./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix022_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix022_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 62c0dd59c00b45603da82019c180716ac53b1b47 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:53,092 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:07:53,094 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:07:53,107 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:07:53,108 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:07:53,109 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:07:53,110 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:07:53,112 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:07:53,115 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:07:53,116 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:07:53,117 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:07:53,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:07:53,118 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:07:53,119 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:07:53,122 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:07:53,123 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:07:53,124 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:07:53,125 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:07:53,128 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:07:53,131 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:07:53,136 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:07:53,140 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:07:53,143 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:07:53,145 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:07:53,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:07:53,150 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:07:53,150 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:07:53,151 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:07:53,153 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:07:53,154 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:07:53,155 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:07:53,156 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:07:53,156 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:07:53,157 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:07:53,159 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:07:53,160 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:07:53,161 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:07:53,161 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:07:53,161 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:07:53,163 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:07:53,166 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:07:53,166 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:53,186 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:07:53,186 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:07:53,188 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:07:53,188 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:07:53,188 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:07:53,191 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:07:53,191 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:07:53,191 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:07:53,191 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:07:53,192 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:07:53,192 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:07:53,192 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:07:53,192 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:07:53,192 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:07:53,193 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:07:53,193 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:07:53,193 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:07:53,193 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:07:53,194 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:07:53,195 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:07:53,195 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:07:53,196 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:07:53,196 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:07:53,196 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:07:53,196 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:07:53,197 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:07:53,197 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:07:53,197 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:07:53,198 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:07:53,198 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 -> 62c0dd59c00b45603da82019c180716ac53b1b47 [2019-11-28 18:07:53,527 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:07:53,540 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:07:53,544 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:07:53,545 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:07:53,546 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:07:53,547 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix022_tso.opt.i [2019-11-28 18:07:53,609 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f3804a65/c799344a17674caf82d8704b8b87dea6/FLAGee2b088a2 [2019-11-28 18:07:54,239 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:07:54,241 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix022_tso.opt.i [2019-11-28 18:07:54,257 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f3804a65/c799344a17674caf82d8704b8b87dea6/FLAGee2b088a2 [2019-11-28 18:07:54,451 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f3804a65/c799344a17674caf82d8704b8b87dea6 [2019-11-28 18:07:54,455 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:07:54,456 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:07:54,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:07:54,458 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:07:54,461 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:07:54,462 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:07:54" (1/1) ... [2019-11-28 18:07:54,465 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@120696db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:54, skipping insertion in model container [2019-11-28 18:07:54,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:07:54" (1/1) ... [2019-11-28 18:07:54,474 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:07:54,519 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:07:55,021 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:07:55,043 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:07:55,179 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:07:55,265 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:07:55,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:55 WrapperNode [2019-11-28 18:07:55,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:07:55,267 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:07:55,267 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:07:55,268 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:07:55,277 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:55" (1/1) ... [2019-11-28 18:07:55,322 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:55" (1/1) ... [2019-11-28 18:07:55,379 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:07:55,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:07:55,380 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:07:55,380 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:07:55,391 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:55" (1/1) ... [2019-11-28 18:07:55,392 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:55" (1/1) ... [2019-11-28 18:07:55,409 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:55" (1/1) ... [2019-11-28 18:07:55,414 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:55" (1/1) ... [2019-11-28 18:07:55,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:55" (1/1) ... [2019-11-28 18:07:55,444 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:55" (1/1) ... [2019-11-28 18:07:55,450 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:55" (1/1) ... [2019-11-28 18:07:55,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:07:55,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:07:55,465 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:07:55,466 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:07:55,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:55" (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:55,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:07:55,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:07:55,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:07:55,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:07:55,538 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:07:55,538 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:07:55,538 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:07:55,538 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:07:55,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:07:55,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:07:55,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:07:55,541 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:56,352 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:07:56,352 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:07:56,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:07:56 BoogieIcfgContainer [2019-11-28 18:07:56,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:07:56,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:07:56,355 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:07:56,358 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:07:56,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:07:54" (1/3) ... [2019-11-28 18:07:56,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f192704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:07:56, skipping insertion in model container [2019-11-28 18:07:56,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:55" (2/3) ... [2019-11-28 18:07:56,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f192704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:07:56, skipping insertion in model container [2019-11-28 18:07:56,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:07:56" (3/3) ... [2019-11-28 18:07:56,362 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_tso.opt.i [2019-11-28 18:07:56,372 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:07:56,373 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:07:56,381 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:07:56,382 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:07:56,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,424 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,424 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,433 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,433 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,434 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,434 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,434 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:56,478 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:07:56,496 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:07:56,496 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:07:56,496 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:07:56,496 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:07:56,497 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:07:56,497 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:07:56,497 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:07:56,497 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:07:56,519 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 244 transitions [2019-11-28 18:07:56,522 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 244 transitions [2019-11-28 18:07:56,691 INFO L134 PetriNetUnfolder]: 62/242 cut-off events. [2019-11-28 18:07:56,691 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:07:56,718 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 242 events. 62/242 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 868 event pairs. 6/184 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-11-28 18:07:56,754 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 244 transitions [2019-11-28 18:07:56,846 INFO L134 PetriNetUnfolder]: 62/242 cut-off events. [2019-11-28 18:07:56,847 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:07:56,861 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 242 events. 62/242 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 868 event pairs. 6/184 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-11-28 18:07:56,898 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 25246 [2019-11-28 18:07:56,899 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:08:01,971 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-28 18:08:02,074 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-28 18:08:02,409 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-11-28 18:08:02,513 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-28 18:08:02,565 INFO L206 etLargeBlockEncoding]: Checked pairs total: 142941 [2019-11-28 18:08:02,565 INFO L214 etLargeBlockEncoding]: Total number of compositions: 118 [2019-11-28 18:08:02,570 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 137 transitions [2019-11-28 18:08:04,847 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27484 states. [2019-11-28 18:08:04,848 INFO L276 IsEmpty]: Start isEmpty. Operand 27484 states. [2019-11-28 18:08:04,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 18:08:04,855 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:04,856 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 18:08:04,857 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:04,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:04,863 INFO L82 PathProgramCache]: Analyzing trace with hash 980256966, now seen corresponding path program 1 times [2019-11-28 18:08:04,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:04,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304938772] [2019-11-28 18:08:04,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:05,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:05,138 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:05,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304938772] [2019-11-28 18:08:05,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:05,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:08:05,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423914753] [2019-11-28 18:08:05,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:08:05,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:05,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:08:05,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:08:05,168 INFO L87 Difference]: Start difference. First operand 27484 states. Second operand 3 states. [2019-11-28 18:08:05,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:05,791 INFO L93 Difference]: Finished difference Result 27436 states and 97226 transitions. [2019-11-28 18:08:05,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:08:05,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 18:08:05,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:06,028 INFO L225 Difference]: With dead ends: 27436 [2019-11-28 18:08:06,030 INFO L226 Difference]: Without dead ends: 26890 [2019-11-28 18:08:06,031 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:08:06,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26890 states. [2019-11-28 18:08:07,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26890 to 26890. [2019-11-28 18:08:07,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26890 states. [2019-11-28 18:08:07,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26890 states to 26890 states and 95406 transitions. [2019-11-28 18:08:07,672 INFO L78 Accepts]: Start accepts. Automaton has 26890 states and 95406 transitions. Word has length 5 [2019-11-28 18:08:07,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:07,673 INFO L462 AbstractCegarLoop]: Abstraction has 26890 states and 95406 transitions. [2019-11-28 18:08:07,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:08:07,673 INFO L276 IsEmpty]: Start isEmpty. Operand 26890 states and 95406 transitions. [2019-11-28 18:08:07,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:08:07,677 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:07,677 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:08:07,678 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:07,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:07,678 INFO L82 PathProgramCache]: Analyzing trace with hash -661538299, now seen corresponding path program 1 times [2019-11-28 18:08:07,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:07,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513114521] [2019-11-28 18:08:07,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:07,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:07,767 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:07,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513114521] [2019-11-28 18:08:07,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:07,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:08:07,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740857782] [2019-11-28 18:08:07,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:08:07,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:07,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:08:07,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:08:07,770 INFO L87 Difference]: Start difference. First operand 26890 states and 95406 transitions. Second operand 4 states. [2019-11-28 18:08:08,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:08,552 INFO L93 Difference]: Finished difference Result 43282 states and 146547 transitions. [2019-11-28 18:08:08,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:08:08,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:08:08,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:08,739 INFO L225 Difference]: With dead ends: 43282 [2019-11-28 18:08:08,739 INFO L226 Difference]: Without dead ends: 43275 [2019-11-28 18:08:08,740 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:08:09,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43275 states. [2019-11-28 18:08:10,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43275 to 41962. [2019-11-28 18:08:10,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41962 states. [2019-11-28 18:08:10,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41962 states to 41962 states and 143055 transitions. [2019-11-28 18:08:10,782 INFO L78 Accepts]: Start accepts. Automaton has 41962 states and 143055 transitions. Word has length 11 [2019-11-28 18:08:10,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:10,783 INFO L462 AbstractCegarLoop]: Abstraction has 41962 states and 143055 transitions. [2019-11-28 18:08:10,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:08:10,783 INFO L276 IsEmpty]: Start isEmpty. Operand 41962 states and 143055 transitions. [2019-11-28 18:08:10,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:08:10,787 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:10,787 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:08:10,788 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:10,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:10,788 INFO L82 PathProgramCache]: Analyzing trace with hash -2102667274, now seen corresponding path program 1 times [2019-11-28 18:08:10,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:10,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135277] [2019-11-28 18:08:10,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:10,876 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:10,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135277] [2019-11-28 18:08:10,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:10,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:08:10,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091085467] [2019-11-28 18:08:10,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:08:10,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:10,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:08:10,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:08:10,879 INFO L87 Difference]: Start difference. First operand 41962 states and 143055 transitions. Second operand 4 states. [2019-11-28 18:08:11,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:11,897 INFO L93 Difference]: Finished difference Result 53078 states and 178895 transitions. [2019-11-28 18:08:11,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:08:11,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:08:11,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:12,080 INFO L225 Difference]: With dead ends: 53078 [2019-11-28 18:08:12,081 INFO L226 Difference]: Without dead ends: 53078 [2019-11-28 18:08:12,081 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:08:12,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53078 states. [2019-11-28 18:08:13,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53078 to 47600. [2019-11-28 18:08:13,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47600 states. [2019-11-28 18:08:13,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47600 states to 47600 states and 161707 transitions. [2019-11-28 18:08:13,857 INFO L78 Accepts]: Start accepts. Automaton has 47600 states and 161707 transitions. Word has length 11 [2019-11-28 18:08:13,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:13,858 INFO L462 AbstractCegarLoop]: Abstraction has 47600 states and 161707 transitions. [2019-11-28 18:08:13,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:08:13,858 INFO L276 IsEmpty]: Start isEmpty. Operand 47600 states and 161707 transitions. [2019-11-28 18:08:13,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 18:08:13,864 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:13,865 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:08:13,865 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:13,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:13,866 INFO L82 PathProgramCache]: Analyzing trace with hash -710819149, now seen corresponding path program 1 times [2019-11-28 18:08:13,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:13,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853554370] [2019-11-28 18:08:13,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:13,999 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:14,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853554370] [2019-11-28 18:08:14,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:14,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:08:14,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005470096] [2019-11-28 18:08:14,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:08:14,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:14,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:08:14,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:08:14,002 INFO L87 Difference]: Start difference. First operand 47600 states and 161707 transitions. Second operand 5 states. [2019-11-28 18:08:15,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:15,389 INFO L93 Difference]: Finished difference Result 63010 states and 210076 transitions. [2019-11-28 18:08:15,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 18:08:15,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-28 18:08:15,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:15,590 INFO L225 Difference]: With dead ends: 63010 [2019-11-28 18:08:15,591 INFO L226 Difference]: Without dead ends: 63003 [2019-11-28 18:08:15,591 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:08:16,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63003 states. [2019-11-28 18:08:16,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63003 to 47611. [2019-11-28 18:08:16,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47611 states. [2019-11-28 18:08:17,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47611 states to 47611 states and 161609 transitions. [2019-11-28 18:08:17,915 INFO L78 Accepts]: Start accepts. Automaton has 47611 states and 161609 transitions. Word has length 17 [2019-11-28 18:08:17,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:17,916 INFO L462 AbstractCegarLoop]: Abstraction has 47611 states and 161609 transitions. [2019-11-28 18:08:17,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:08:17,916 INFO L276 IsEmpty]: Start isEmpty. Operand 47611 states and 161609 transitions. [2019-11-28 18:08:17,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 18:08:17,942 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:17,942 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:08:17,942 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:17,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:17,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1473983183, now seen corresponding path program 1 times [2019-11-28 18:08:17,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:17,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202195065] [2019-11-28 18:08:17,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:18,070 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:18,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202195065] [2019-11-28 18:08:18,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:18,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:08:18,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38751731] [2019-11-28 18:08:18,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:08:18,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:18,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:08:18,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:08:18,073 INFO L87 Difference]: Start difference. First operand 47611 states and 161609 transitions. Second operand 4 states. [2019-11-28 18:08:18,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:18,122 INFO L93 Difference]: Finished difference Result 5620 states and 14074 transitions. [2019-11-28 18:08:18,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:08:18,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-28 18:08:18,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:18,131 INFO L225 Difference]: With dead ends: 5620 [2019-11-28 18:08:18,132 INFO L226 Difference]: Without dead ends: 4725 [2019-11-28 18:08:18,133 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:08:18,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4725 states. [2019-11-28 18:08:18,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4725 to 4725. [2019-11-28 18:08:18,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2019-11-28 18:08:18,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 11319 transitions. [2019-11-28 18:08:18,209 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 11319 transitions. Word has length 25 [2019-11-28 18:08:18,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:18,209 INFO L462 AbstractCegarLoop]: Abstraction has 4725 states and 11319 transitions. [2019-11-28 18:08:18,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:08:18,213 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 11319 transitions. [2019-11-28 18:08:18,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 18:08:18,219 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:18,219 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] [2019-11-28 18:08:18,219 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:18,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:18,220 INFO L82 PathProgramCache]: Analyzing trace with hash 14742150, now seen corresponding path program 1 times [2019-11-28 18:08:18,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:18,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217647477] [2019-11-28 18:08:18,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:18,318 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:18,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217647477] [2019-11-28 18:08:18,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:18,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:08:18,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986221596] [2019-11-28 18:08:18,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:08:18,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:18,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:08:18,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:08:18,320 INFO L87 Difference]: Start difference. First operand 4725 states and 11319 transitions. Second operand 5 states. [2019-11-28 18:08:18,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:18,367 INFO L93 Difference]: Finished difference Result 1095 states and 2326 transitions. [2019-11-28 18:08:18,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:08:18,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-11-28 18:08:18,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:18,369 INFO L225 Difference]: With dead ends: 1095 [2019-11-28 18:08:18,369 INFO L226 Difference]: Without dead ends: 991 [2019-11-28 18:08:18,370 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:08:18,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-11-28 18:08:18,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 949. [2019-11-28 18:08:18,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 949 states. [2019-11-28 18:08:18,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 2023 transitions. [2019-11-28 18:08:18,379 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 2023 transitions. Word has length 37 [2019-11-28 18:08:18,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:18,379 INFO L462 AbstractCegarLoop]: Abstraction has 949 states and 2023 transitions. [2019-11-28 18:08:18,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:08:18,380 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 2023 transitions. [2019-11-28 18:08:18,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-28 18:08:18,383 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:18,383 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:08:18,383 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:18,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:18,386 INFO L82 PathProgramCache]: Analyzing trace with hash -436222142, now seen corresponding path program 1 times [2019-11-28 18:08:18,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:18,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714407021] [2019-11-28 18:08:18,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:18,527 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:18,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714407021] [2019-11-28 18:08:18,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:18,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:08:18,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22033813] [2019-11-28 18:08:18,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:08:18,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:18,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:08:18,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:08:18,531 INFO L87 Difference]: Start difference. First operand 949 states and 2023 transitions. Second operand 6 states. [2019-11-28 18:08:19,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:19,146 INFO L93 Difference]: Finished difference Result 1405 states and 2968 transitions. [2019-11-28 18:08:19,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 18:08:19,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-11-28 18:08:19,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:19,148 INFO L225 Difference]: With dead ends: 1405 [2019-11-28 18:08:19,148 INFO L226 Difference]: Without dead ends: 1405 [2019-11-28 18:08:19,149 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:08:19,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2019-11-28 18:08:19,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1132. [2019-11-28 18:08:19,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2019-11-28 18:08:19,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 2413 transitions. [2019-11-28 18:08:19,161 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 2413 transitions. Word has length 68 [2019-11-28 18:08:19,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:19,162 INFO L462 AbstractCegarLoop]: Abstraction has 1132 states and 2413 transitions. [2019-11-28 18:08:19,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:08:19,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 2413 transitions. [2019-11-28 18:08:19,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-28 18:08:19,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:19,165 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:08:19,166 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:19,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:19,166 INFO L82 PathProgramCache]: Analyzing trace with hash 859631310, now seen corresponding path program 2 times [2019-11-28 18:08:19,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:19,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330899026] [2019-11-28 18:08:19,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:19,311 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:19,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330899026] [2019-11-28 18:08:19,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:19,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:08:19,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476735274] [2019-11-28 18:08:19,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:08:19,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:19,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:08:19,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:08:19,316 INFO L87 Difference]: Start difference. First operand 1132 states and 2413 transitions. Second operand 3 states. [2019-11-28 18:08:19,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:19,333 INFO L93 Difference]: Finished difference Result 963 states and 2007 transitions. [2019-11-28 18:08:19,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:08:19,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-11-28 18:08:19,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:19,336 INFO L225 Difference]: With dead ends: 963 [2019-11-28 18:08:19,337 INFO L226 Difference]: Without dead ends: 963 [2019-11-28 18:08:19,337 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:19,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-11-28 18:08:19,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2019-11-28 18:08:19,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-11-28 18:08:19,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 2007 transitions. [2019-11-28 18:08:19,354 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 2007 transitions. Word has length 68 [2019-11-28 18:08:19,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:19,355 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 2007 transitions. [2019-11-28 18:08:19,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:08:19,355 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 2007 transitions. [2019-11-28 18:08:19,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-28 18:08:19,361 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:19,362 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:08:19,362 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:19,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:19,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1270284952, now seen corresponding path program 1 times [2019-11-28 18:08:19,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:19,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481224475] [2019-11-28 18:08:19,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:19,472 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:19,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481224475] [2019-11-28 18:08:19,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:19,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:08:19,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612083779] [2019-11-28 18:08:19,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:08:19,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:19,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:08:19,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:08:19,474 INFO L87 Difference]: Start difference. First operand 963 states and 2007 transitions. Second operand 5 states. [2019-11-28 18:08:19,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:19,703 INFO L93 Difference]: Finished difference Result 1101 states and 2255 transitions. [2019-11-28 18:08:19,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:08:19,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-11-28 18:08:19,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:19,705 INFO L225 Difference]: With dead ends: 1101 [2019-11-28 18:08:19,705 INFO L226 Difference]: Without dead ends: 1101 [2019-11-28 18:08:19,706 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:08:19,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2019-11-28 18:08:19,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1048. [2019-11-28 18:08:19,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-11-28 18:08:19,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 2161 transitions. [2019-11-28 18:08:19,720 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 2161 transitions. Word has length 69 [2019-11-28 18:08:19,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:19,721 INFO L462 AbstractCegarLoop]: Abstraction has 1048 states and 2161 transitions. [2019-11-28 18:08:19,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:08:19,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 2161 transitions. [2019-11-28 18:08:19,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-28 18:08:19,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:19,723 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:08:19,723 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:19,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:19,724 INFO L82 PathProgramCache]: Analyzing trace with hash 25568500, now seen corresponding path program 2 times [2019-11-28 18:08:19,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:19,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574922899] [2019-11-28 18:08:19,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:19,950 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:19,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574922899] [2019-11-28 18:08:19,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:19,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 18:08:19,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98828861] [2019-11-28 18:08:19,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 18:08:19,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:19,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 18:08:19,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 18:08:19,952 INFO L87 Difference]: Start difference. First operand 1048 states and 2161 transitions. Second operand 8 states. [2019-11-28 18:08:20,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:20,843 INFO L93 Difference]: Finished difference Result 2201 states and 4522 transitions. [2019-11-28 18:08:20,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 18:08:20,843 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2019-11-28 18:08:20,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:20,846 INFO L225 Difference]: With dead ends: 2201 [2019-11-28 18:08:20,847 INFO L226 Difference]: Without dead ends: 2201 [2019-11-28 18:08:20,847 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-28 18:08:20,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2201 states. [2019-11-28 18:08:20,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2201 to 1595. [2019-11-28 18:08:20,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1595 states. [2019-11-28 18:08:20,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 3328 transitions. [2019-11-28 18:08:20,875 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 3328 transitions. Word has length 69 [2019-11-28 18:08:20,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:20,875 INFO L462 AbstractCegarLoop]: Abstraction has 1595 states and 3328 transitions. [2019-11-28 18:08:20,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 18:08:20,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 3328 transitions. [2019-11-28 18:08:20,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-28 18:08:20,879 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:20,879 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:08:20,879 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:20,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:20,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1502663669, now seen corresponding path program 1 times [2019-11-28 18:08:20,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:20,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128525951] [2019-11-28 18:08:20,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:20,994 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:20,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128525951] [2019-11-28 18:08:20,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:20,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:08:20,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077869041] [2019-11-28 18:08:20,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:08:20,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:20,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:08:20,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:08:20,996 INFO L87 Difference]: Start difference. First operand 1595 states and 3328 transitions. Second operand 6 states. [2019-11-28 18:08:21,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:21,445 INFO L93 Difference]: Finished difference Result 2446 states and 5110 transitions. [2019-11-28 18:08:21,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 18:08:21,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-11-28 18:08:21,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:21,449 INFO L225 Difference]: With dead ends: 2446 [2019-11-28 18:08:21,450 INFO L226 Difference]: Without dead ends: 2446 [2019-11-28 18:08:21,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:08:21,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2446 states. [2019-11-28 18:08:21,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2446 to 1659. [2019-11-28 18:08:21,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1659 states. [2019-11-28 18:08:21,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 3468 transitions. [2019-11-28 18:08:21,474 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 3468 transitions. Word has length 70 [2019-11-28 18:08:21,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:21,474 INFO L462 AbstractCegarLoop]: Abstraction has 1659 states and 3468 transitions. [2019-11-28 18:08:21,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:08:21,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 3468 transitions. [2019-11-28 18:08:21,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-28 18:08:21,477 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:21,477 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:08:21,477 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:21,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:21,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1241316174, now seen corresponding path program 1 times [2019-11-28 18:08:21,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:21,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037165263] [2019-11-28 18:08:21,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:21,563 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:21,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037165263] [2019-11-28 18:08:21,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:21,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:08:21,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998468319] [2019-11-28 18:08:21,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:08:21,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:21,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:08:21,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:08:21,565 INFO L87 Difference]: Start difference. First operand 1659 states and 3468 transitions. Second operand 3 states. [2019-11-28 18:08:21,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:21,606 INFO L93 Difference]: Finished difference Result 1658 states and 3466 transitions. [2019-11-28 18:08:21,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:08:21,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-11-28 18:08:21,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:21,609 INFO L225 Difference]: With dead ends: 1658 [2019-11-28 18:08:21,609 INFO L226 Difference]: Without dead ends: 1658 [2019-11-28 18:08:21,609 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:21,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2019-11-28 18:08:21,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1419. [2019-11-28 18:08:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-11-28 18:08:21,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2987 transitions. [2019-11-28 18:08:21,628 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2987 transitions. Word has length 70 [2019-11-28 18:08:21,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:21,628 INFO L462 AbstractCegarLoop]: Abstraction has 1419 states and 2987 transitions. [2019-11-28 18:08:21,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:08:21,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2987 transitions. [2019-11-28 18:08:21,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-28 18:08:21,630 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:21,630 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:08:21,631 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:21,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:21,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1779301553, now seen corresponding path program 2 times [2019-11-28 18:08:21,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:21,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651000157] [2019-11-28 18:08:21,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:21,784 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:21,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651000157] [2019-11-28 18:08:21,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:21,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:08:21,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199965089] [2019-11-28 18:08:21,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:08:21,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:21,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:08:21,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:08:21,795 INFO L87 Difference]: Start difference. First operand 1419 states and 2987 transitions. Second operand 6 states. [2019-11-28 18:08:22,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:22,133 INFO L93 Difference]: Finished difference Result 1505 states and 3137 transitions. [2019-11-28 18:08:22,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 18:08:22,134 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-11-28 18:08:22,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:22,136 INFO L225 Difference]: With dead ends: 1505 [2019-11-28 18:08:22,136 INFO L226 Difference]: Without dead ends: 1505 [2019-11-28 18:08:22,136 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-28 18:08:22,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2019-11-28 18:08:22,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1375. [2019-11-28 18:08:22,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1375 states. [2019-11-28 18:08:22,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 2859 transitions. [2019-11-28 18:08:22,158 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 2859 transitions. Word has length 70 [2019-11-28 18:08:22,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:22,159 INFO L462 AbstractCegarLoop]: Abstraction has 1375 states and 2859 transitions. [2019-11-28 18:08:22,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:08:22,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 2859 transitions. [2019-11-28 18:08:22,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-28 18:08:22,163 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:22,163 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:08:22,164 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:22,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:22,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1388303069, now seen corresponding path program 3 times [2019-11-28 18:08:22,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:22,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426164386] [2019-11-28 18:08:22,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:22,318 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:22,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426164386] [2019-11-28 18:08:22,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:22,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:08:22,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277953545] [2019-11-28 18:08:22,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:08:22,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:22,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:08:22,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:08:22,322 INFO L87 Difference]: Start difference. First operand 1375 states and 2859 transitions. Second operand 7 states. [2019-11-28 18:08:22,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:22,713 INFO L93 Difference]: Finished difference Result 1568 states and 3242 transitions. [2019-11-28 18:08:22,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 18:08:22,713 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-11-28 18:08:22,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:22,716 INFO L225 Difference]: With dead ends: 1568 [2019-11-28 18:08:22,716 INFO L226 Difference]: Without dead ends: 1568 [2019-11-28 18:08:22,716 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:08:22,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2019-11-28 18:08:22,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1152. [2019-11-28 18:08:22,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2019-11-28 18:08:22,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 2378 transitions. [2019-11-28 18:08:22,730 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 2378 transitions. Word has length 70 [2019-11-28 18:08:22,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:22,730 INFO L462 AbstractCegarLoop]: Abstraction has 1152 states and 2378 transitions. [2019-11-28 18:08:22,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:08:22,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 2378 transitions. [2019-11-28 18:08:22,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-28 18:08:22,732 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:22,732 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:08:22,732 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:22,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:22,733 INFO L82 PathProgramCache]: Analyzing trace with hash 53631247, now seen corresponding path program 4 times [2019-11-28 18:08:22,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:22,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332151358] [2019-11-28 18:08:22,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:22,898 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:22,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332151358] [2019-11-28 18:08:22,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:22,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:08:22,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018338852] [2019-11-28 18:08:22,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:08:22,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:22,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:08:22,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:08:22,901 INFO L87 Difference]: Start difference. First operand 1152 states and 2378 transitions. Second operand 7 states. [2019-11-28 18:08:23,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:23,359 INFO L93 Difference]: Finished difference Result 1371 states and 2802 transitions. [2019-11-28 18:08:23,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:08:23,360 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-11-28 18:08:23,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:23,362 INFO L225 Difference]: With dead ends: 1371 [2019-11-28 18:08:23,362 INFO L226 Difference]: Without dead ends: 1371 [2019-11-28 18:08:23,363 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-28 18:08:23,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2019-11-28 18:08:23,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1096. [2019-11-28 18:08:23,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1096 states. [2019-11-28 18:08:23,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 2261 transitions. [2019-11-28 18:08:23,375 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 2261 transitions. Word has length 70 [2019-11-28 18:08:23,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:23,376 INFO L462 AbstractCegarLoop]: Abstraction has 1096 states and 2261 transitions. [2019-11-28 18:08:23,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:08:23,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 2261 transitions. [2019-11-28 18:08:23,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-28 18:08:23,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:23,378 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:08:23,378 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:23,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:23,378 INFO L82 PathProgramCache]: Analyzing trace with hash -2069710509, now seen corresponding path program 1 times [2019-11-28 18:08:23,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:23,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641998465] [2019-11-28 18:08:23,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:23,522 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:23,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641998465] [2019-11-28 18:08:23,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:23,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:08:23,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214611703] [2019-11-28 18:08:23,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:08:23,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:23,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:08:23,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:08:23,525 INFO L87 Difference]: Start difference. First operand 1096 states and 2261 transitions. Second operand 6 states. [2019-11-28 18:08:23,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:23,633 INFO L93 Difference]: Finished difference Result 1377 states and 2804 transitions. [2019-11-28 18:08:23,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:08:23,634 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-11-28 18:08:23,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:23,635 INFO L225 Difference]: With dead ends: 1377 [2019-11-28 18:08:23,635 INFO L226 Difference]: Without dead ends: 248 [2019-11-28 18:08:23,636 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:08:23,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-28 18:08:23,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 224. [2019-11-28 18:08:23,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-28 18:08:23,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 377 transitions. [2019-11-28 18:08:23,638 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 377 transitions. Word has length 71 [2019-11-28 18:08:23,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:23,639 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 377 transitions. [2019-11-28 18:08:23,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:08:23,639 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 377 transitions. [2019-11-28 18:08:23,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-28 18:08:23,641 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:23,641 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:08:23,642 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:23,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:23,642 INFO L82 PathProgramCache]: Analyzing trace with hash 915841789, now seen corresponding path program 2 times [2019-11-28 18:08:23,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:23,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678491132] [2019-11-28 18:08:23,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:08:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:08:23,784 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:08:23,785 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:08:23,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_52| 0 0))) (and (= v_~x$r_buff1_thd1~0_179 0) (= v_~weak$$choice2~0_240 0) (= v_~main$tmp_guard0~0_30 0) (= 0 v_~x$mem_tmp~0_174) (= 0 v_~x~0_313) (= v_~x$r_buff1_thd0~0_357 0) (= v_~__unbuffered_p1_EBX~0_40 0) (= 0 v_~x$w_buff0_used~0_865) (= 0 v_~x$read_delayed_var~0.base_7) (< 0 |v_#StackHeapBarrier_15|) (= v_~y~0_29 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t599~0.base_29|) 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~x$w_buff0~0_223) (= 0 |v_ULTIMATE.start_main_~#t599~0.offset_21|) (= 0 v_~x$r_buff0_thd2~0_470) (= 0 v_~x$w_buff1_used~0_522) (= 0 v_~__unbuffered_p1_EAX~0_63) (= v_~x$r_buff0_thd0~0_374 0) (= |v_#NULL.offset_5| 0) (= 0 v_~x$r_buff1_thd2~0_352) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t599~0.base_29|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t599~0.base_29| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t599~0.base_29|) |v_ULTIMATE.start_main_~#t599~0.offset_21| 0)) |v_#memory_int_17|) (= 0 v_~x$r_buff0_thd1~0_99) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~__unbuffered_cnt~0_43) (= 0 v_~x$w_buff1~0_209) (= v_~x$flush_delayed~0_235 0) (= |v_#valid_50| (store .cse0 |v_ULTIMATE.start_main_~#t599~0.base_29| 1)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t599~0.base_29| 4)) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_159) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_223, ~x$flush_delayed~0=v_~x$flush_delayed~0_235, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_123|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_80|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_179, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_113|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_55|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_35|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_52|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_63, #length=|v_#length_19|, ULTIMATE.start_main_~#t600~0.offset=|v_ULTIMATE.start_main_~#t600~0.offset_21|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_374, ULTIMATE.start_main_#t~nondet47=|v_ULTIMATE.start_main_#t~nondet47_57|, ~x$w_buff1~0=v_~x$w_buff1~0_209, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_42|, ULTIMATE.start_main_~#t600~0.base=|v_ULTIMATE.start_main_~#t600~0.base_29|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_522, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_352, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_65|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_36|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_33|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_49|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_93|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, ~x~0=v_~x~0_313, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_99, ULTIMATE.start_main_~#t599~0.base=|v_ULTIMATE.start_main_~#t599~0.base_29|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_69|, ~x$mem_tmp~0=v_~x$mem_tmp~0_174, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_141|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_27|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_50|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_61|, ~y~0=v_~y~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_57|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_40|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_105|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_357, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_470, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_62|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_95|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_865, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_30|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_152|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_45|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ~weak$$choice2~0=v_~weak$$choice2~0_240, ULTIMATE.start_main_~#t599~0.offset=|v_ULTIMATE.start_main_~#t599~0.offset_21|, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t600~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet47, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t600~0.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite56, ~x$read_delayed_var~0.base, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t599~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite51, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite60, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ULTIMATE.start_main_~#t599~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:08:23,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L797-1-->L799: Formula: (and (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t600~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t600~0.base_13|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t600~0.base_13|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t600~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t600~0.base_13|) |v_ULTIMATE.start_main_~#t600~0.offset_11| 1))) (= |v_ULTIMATE.start_main_~#t600~0.offset_11| 0) (= |v_#valid_26| (store |v_#valid_27| |v_ULTIMATE.start_main_~#t600~0.base_13| 1)) (= 0 (select |v_#valid_27| |v_ULTIMATE.start_main_~#t600~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t600~0.offset=|v_ULTIMATE.start_main_~#t600~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, ULTIMATE.start_main_~#t600~0.base=|v_ULTIMATE.start_main_~#t600~0.base_13|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t600~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t600~0.base, #length] because there is no mapped edge [2019-11-28 18:08:23,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] P1ENTRY-->L4-3: Formula: (and (= v_~x$w_buff1_used~0_77 v_~x$w_buff0_used~0_156) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_5) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 0)) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= 2 v_~x$w_buff0~0_34) (= (ite (not (and (not (= 0 (mod v_~x$w_buff0_used~0_155 256))) (not (= 0 (mod v_~x$w_buff1_used~0_77 256))))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= 1 v_~x$w_buff0_used~0_155) (= v_~x$w_buff0~0_35 v_~x$w_buff1~0_28)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_156} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_34, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_28, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_77, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_155} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-11-28 18:08:23,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L759-2-->L759-5: Formula: (let ((.cse2 (= |P1Thread1of1ForFork1_#t~ite11_Out-386119531| |P1Thread1of1ForFork1_#t~ite12_Out-386119531|)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-386119531 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-386119531 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-386119531| ~x$w_buff0~0_In-386119531) (not .cse0) (not .cse1) .cse2) (and .cse2 (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-386119531| ~x$w_buff1~0_In-386119531)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-386119531, ~x$w_buff1~0=~x$w_buff1~0_In-386119531, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-386119531, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-386119531} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-386119531, ~x$w_buff1~0=~x$w_buff1~0_In-386119531, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-386119531|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-386119531|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-386119531, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-386119531} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-11-28 18:08:23,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L764-->L765: Formula: (and (= v_~x$r_buff0_thd2~0_138 v_~x$r_buff0_thd2~0_137) (not (= 0 (mod v_~weak$$choice2~0_59 256)))) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_138, ~weak$$choice2~0=v_~weak$$choice2~0_59} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_59, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_15|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:08:23,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In1349813045 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite31_Out1349813045| ~x~0_In1349813045) .cse0) (and (= ~x$mem_tmp~0_In1349813045 |P1Thread1of1ForFork1_#t~ite31_Out1349813045|) (not .cse0)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In1349813045, ~x$mem_tmp~0=~x$mem_tmp~0_In1349813045, ~x~0=~x~0_In1349813045} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In1349813045, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out1349813045|, ~x$mem_tmp~0=~x$mem_tmp~0_In1349813045, ~x~0=~x~0_In1349813045} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-11-28 18:08:23,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L730-2-->L730-5: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1428017366 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-1428017366 256))) (.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out-1428017366| |P0Thread1of1ForFork0_#t~ite3_Out-1428017366|))) (or (and (or .cse0 .cse1) .cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out-1428017366| ~x~0_In-1428017366)) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite3_Out-1428017366| ~x$w_buff1~0_In-1428017366) (not .cse0) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1428017366, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1428017366, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1428017366, ~x~0=~x~0_In-1428017366} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1428017366|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-1428017366|, ~x$w_buff1~0=~x$w_buff1~0_In-1428017366, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1428017366, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1428017366, ~x~0=~x~0_In-1428017366} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-11-28 18:08:23,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L731-->L731-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-153356130 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-153356130 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-153356130|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-153356130 |P0Thread1of1ForFork0_#t~ite5_Out-153356130|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-153356130, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-153356130} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-153356130|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-153356130, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-153356130} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:08:23,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-123353996 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-123353996 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-123353996 |P1Thread1of1ForFork1_#t~ite34_Out-123353996|)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-123353996|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-123353996, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-123353996} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-123353996|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-123353996, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-123353996} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:08:23,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In1564503399 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In1564503399 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1564503399 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1564503399 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1564503399|)) (and (= ~x$w_buff1_used~0_In1564503399 |P1Thread1of1ForFork1_#t~ite35_Out1564503399|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1564503399, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1564503399, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1564503399, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1564503399} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1564503399, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1564503399, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1564503399|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1564503399, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1564503399} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:08:23,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L777-->L778: Formula: (let ((.cse0 (= ~x$r_buff0_thd2~0_In-1605601860 ~x$r_buff0_thd2~0_Out-1605601860)) (.cse2 (= (mod ~x$w_buff0_used~0_In-1605601860 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-1605601860 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= 0 ~x$r_buff0_thd2~0_Out-1605601860) (not .cse2) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1605601860, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1605601860} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1605601860, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1605601860|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1605601860} AuxVars[] AssignedVars[~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:08:23,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In756290536 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In756290536 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In756290536 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In756290536 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out756290536|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$r_buff1_thd2~0_In756290536 |P1Thread1of1ForFork1_#t~ite37_Out756290536|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In756290536, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In756290536, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In756290536, ~x$w_buff0_used~0=~x$w_buff0_used~0_In756290536} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In756290536, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In756290536, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In756290536, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out756290536|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In756290536} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:08:23,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L778-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~x$r_buff1_thd2~0_154 |v_P1Thread1of1ForFork1_#t~ite37_20|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_20|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_154, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_19|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:08:23,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L732-->L732-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-729285326 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-729285326 256))) (.cse2 (= (mod ~x$r_buff1_thd1~0_In-729285326 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-729285326 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-729285326|)) (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-729285326 |P0Thread1of1ForFork0_#t~ite6_Out-729285326|) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-729285326, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-729285326, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-729285326, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-729285326} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-729285326|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-729285326, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-729285326, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-729285326, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-729285326} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:08:23,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L733-->L733-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1836888034 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1836888034 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out1836888034| ~x$r_buff0_thd1~0_In1836888034)) (and (= |P0Thread1of1ForFork0_#t~ite7_Out1836888034| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1836888034, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1836888034} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1836888034, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1836888034|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1836888034} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-11-28 18:08:23,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L734-->L734-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-1754190693 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1754190693 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1754190693 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-1754190693 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd1~0_In-1754190693 |P0Thread1of1ForFork0_#t~ite8_Out-1754190693|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1754190693|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1754190693, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1754190693, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1754190693, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1754190693} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1754190693, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1754190693|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1754190693, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1754190693, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1754190693} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:08:23,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L734-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_140 |v_P0Thread1of1ForFork0_#t~ite8_24|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_23|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_140} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-11-28 18:08:23,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L803-->L805-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~x$r_buff0_thd0~0_54 256)) (= 0 (mod v_~x$w_buff0_used~0_123 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_54, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_54, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:08:23,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [929] [929] L805-2-->L805-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1710390638 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-1710390638 256) 0))) (or (and (or .cse0 .cse1) (= ~x~0_In-1710390638 |ULTIMATE.start_main_#t~ite40_Out-1710390638|)) (and (not .cse1) (= ~x$w_buff1~0_In-1710390638 |ULTIMATE.start_main_#t~ite40_Out-1710390638|) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1710390638, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1710390638, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1710390638, ~x~0=~x~0_In-1710390638} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1710390638|, ~x$w_buff1~0=~x$w_buff1~0_In-1710390638, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1710390638, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1710390638, ~x~0=~x~0_In-1710390638} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:08:23,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L805-4-->L806: Formula: (= v_~x~0_51 |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_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~x~0=v_~x~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-11-28 18:08:23,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In2036185367 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In2036185367 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out2036185367| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite42_Out2036185367| ~x$w_buff0_used~0_In2036185367)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2036185367, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2036185367} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2036185367, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out2036185367|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2036185367} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:08:23,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L807-->L807-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd0~0_In-1087693761 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1087693761 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1087693761 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1087693761 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-1087693761|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-1087693761 |ULTIMATE.start_main_#t~ite43_Out-1087693761|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1087693761, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1087693761, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1087693761, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1087693761} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1087693761, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1087693761, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1087693761|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1087693761, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1087693761} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:08:23,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In531777714 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In531777714 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out531777714| 0)) (and (= ~x$r_buff0_thd0~0_In531777714 |ULTIMATE.start_main_#t~ite44_Out531777714|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In531777714, ~x$w_buff0_used~0=~x$w_buff0_used~0_In531777714} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In531777714, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out531777714|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In531777714} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:08:23,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd0~0_In-294258112 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-294258112 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-294258112 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-294258112 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-294258112| ~x$r_buff1_thd0~0_In-294258112) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-294258112|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-294258112, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-294258112, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-294258112, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-294258112} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-294258112, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-294258112, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-294258112, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-294258112|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-294258112} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:08:23,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In-1785703275 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite68_Out-1785703275| ~x$mem_tmp~0_In-1785703275) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite68_Out-1785703275| ~x~0_In-1785703275) .cse0))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-1785703275, ~x$mem_tmp~0=~x$mem_tmp~0_In-1785703275, ~x~0=~x~0_In-1785703275} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In-1785703275, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-1785703275|, ~x$mem_tmp~0=~x$mem_tmp~0_In-1785703275, ~x~0=~x~0_In-1785703275} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-11-28 18:08:23,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L824-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~x$flush_delayed~0_193 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= (mod v_~main$tmp_guard1~0_29 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= |v_ULTIMATE.start_main_#t~ite68_38| v_~x~0_259)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_38|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~x$flush_delayed~0=v_~x$flush_delayed~0_193, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_37|, ~x~0=v_~x~0_259, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite68, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:08:23,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:08:23 BasicIcfg [2019-11-28 18:08:23,961 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:08:23,961 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:08:23,962 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:08:23,962 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:08:23,962 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:56" (3/4) ... [2019-11-28 18:08:23,965 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:08:23,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_52| 0 0))) (and (= v_~x$r_buff1_thd1~0_179 0) (= v_~weak$$choice2~0_240 0) (= v_~main$tmp_guard0~0_30 0) (= 0 v_~x$mem_tmp~0_174) (= 0 v_~x~0_313) (= v_~x$r_buff1_thd0~0_357 0) (= v_~__unbuffered_p1_EBX~0_40 0) (= 0 v_~x$w_buff0_used~0_865) (= 0 v_~x$read_delayed_var~0.base_7) (< 0 |v_#StackHeapBarrier_15|) (= v_~y~0_29 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t599~0.base_29|) 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~x$w_buff0~0_223) (= 0 |v_ULTIMATE.start_main_~#t599~0.offset_21|) (= 0 v_~x$r_buff0_thd2~0_470) (= 0 v_~x$w_buff1_used~0_522) (= 0 v_~__unbuffered_p1_EAX~0_63) (= v_~x$r_buff0_thd0~0_374 0) (= |v_#NULL.offset_5| 0) (= 0 v_~x$r_buff1_thd2~0_352) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t599~0.base_29|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t599~0.base_29| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t599~0.base_29|) |v_ULTIMATE.start_main_~#t599~0.offset_21| 0)) |v_#memory_int_17|) (= 0 v_~x$r_buff0_thd1~0_99) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~__unbuffered_cnt~0_43) (= 0 v_~x$w_buff1~0_209) (= v_~x$flush_delayed~0_235 0) (= |v_#valid_50| (store .cse0 |v_ULTIMATE.start_main_~#t599~0.base_29| 1)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t599~0.base_29| 4)) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_159) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_223, ~x$flush_delayed~0=v_~x$flush_delayed~0_235, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_123|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_80|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_179, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_113|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_55|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_35|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_52|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_63, #length=|v_#length_19|, ULTIMATE.start_main_~#t600~0.offset=|v_ULTIMATE.start_main_~#t600~0.offset_21|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_374, ULTIMATE.start_main_#t~nondet47=|v_ULTIMATE.start_main_#t~nondet47_57|, ~x$w_buff1~0=v_~x$w_buff1~0_209, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_42|, ULTIMATE.start_main_~#t600~0.base=|v_ULTIMATE.start_main_~#t600~0.base_29|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_522, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_352, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_65|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_36|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_33|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_49|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_93|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, ~x~0=v_~x~0_313, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_99, ULTIMATE.start_main_~#t599~0.base=|v_ULTIMATE.start_main_~#t599~0.base_29|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_69|, ~x$mem_tmp~0=v_~x$mem_tmp~0_174, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_141|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_27|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_50|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_61|, ~y~0=v_~y~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_57|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_40|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_105|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_357, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_470, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_62|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_95|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_865, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_30|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_152|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_45|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ~weak$$choice2~0=v_~weak$$choice2~0_240, ULTIMATE.start_main_~#t599~0.offset=|v_ULTIMATE.start_main_~#t599~0.offset_21|, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t600~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet47, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t600~0.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite56, ~x$read_delayed_var~0.base, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t599~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite51, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite60, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ULTIMATE.start_main_~#t599~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:08:23,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L797-1-->L799: Formula: (and (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t600~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t600~0.base_13|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t600~0.base_13|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t600~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t600~0.base_13|) |v_ULTIMATE.start_main_~#t600~0.offset_11| 1))) (= |v_ULTIMATE.start_main_~#t600~0.offset_11| 0) (= |v_#valid_26| (store |v_#valid_27| |v_ULTIMATE.start_main_~#t600~0.base_13| 1)) (= 0 (select |v_#valid_27| |v_ULTIMATE.start_main_~#t600~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t600~0.offset=|v_ULTIMATE.start_main_~#t600~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, ULTIMATE.start_main_~#t600~0.base=|v_ULTIMATE.start_main_~#t600~0.base_13|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t600~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t600~0.base, #length] because there is no mapped edge [2019-11-28 18:08:23,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] P1ENTRY-->L4-3: Formula: (and (= v_~x$w_buff1_used~0_77 v_~x$w_buff0_used~0_156) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_5) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 0)) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= 2 v_~x$w_buff0~0_34) (= (ite (not (and (not (= 0 (mod v_~x$w_buff0_used~0_155 256))) (not (= 0 (mod v_~x$w_buff1_used~0_77 256))))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= 1 v_~x$w_buff0_used~0_155) (= v_~x$w_buff0~0_35 v_~x$w_buff1~0_28)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_156} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_34, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_28, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_77, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_155} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-11-28 18:08:23,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L759-2-->L759-5: Formula: (let ((.cse2 (= |P1Thread1of1ForFork1_#t~ite11_Out-386119531| |P1Thread1of1ForFork1_#t~ite12_Out-386119531|)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-386119531 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-386119531 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-386119531| ~x$w_buff0~0_In-386119531) (not .cse0) (not .cse1) .cse2) (and .cse2 (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-386119531| ~x$w_buff1~0_In-386119531)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-386119531, ~x$w_buff1~0=~x$w_buff1~0_In-386119531, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-386119531, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-386119531} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-386119531, ~x$w_buff1~0=~x$w_buff1~0_In-386119531, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-386119531|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-386119531|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-386119531, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-386119531} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-11-28 18:08:23,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L764-->L765: Formula: (and (= v_~x$r_buff0_thd2~0_138 v_~x$r_buff0_thd2~0_137) (not (= 0 (mod v_~weak$$choice2~0_59 256)))) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_138, ~weak$$choice2~0=v_~weak$$choice2~0_59} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_59, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_15|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:08:23,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In1349813045 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite31_Out1349813045| ~x~0_In1349813045) .cse0) (and (= ~x$mem_tmp~0_In1349813045 |P1Thread1of1ForFork1_#t~ite31_Out1349813045|) (not .cse0)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In1349813045, ~x$mem_tmp~0=~x$mem_tmp~0_In1349813045, ~x~0=~x~0_In1349813045} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In1349813045, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out1349813045|, ~x$mem_tmp~0=~x$mem_tmp~0_In1349813045, ~x~0=~x~0_In1349813045} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-11-28 18:08:23,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L730-2-->L730-5: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1428017366 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-1428017366 256))) (.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out-1428017366| |P0Thread1of1ForFork0_#t~ite3_Out-1428017366|))) (or (and (or .cse0 .cse1) .cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out-1428017366| ~x~0_In-1428017366)) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite3_Out-1428017366| ~x$w_buff1~0_In-1428017366) (not .cse0) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1428017366, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1428017366, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1428017366, ~x~0=~x~0_In-1428017366} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1428017366|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-1428017366|, ~x$w_buff1~0=~x$w_buff1~0_In-1428017366, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1428017366, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1428017366, ~x~0=~x~0_In-1428017366} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-11-28 18:08:23,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L731-->L731-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-153356130 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-153356130 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-153356130|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-153356130 |P0Thread1of1ForFork0_#t~ite5_Out-153356130|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-153356130, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-153356130} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-153356130|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-153356130, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-153356130} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:08:23,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-123353996 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-123353996 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-123353996 |P1Thread1of1ForFork1_#t~ite34_Out-123353996|)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-123353996|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-123353996, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-123353996} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-123353996|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-123353996, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-123353996} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:08:23,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In1564503399 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In1564503399 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1564503399 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1564503399 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1564503399|)) (and (= ~x$w_buff1_used~0_In1564503399 |P1Thread1of1ForFork1_#t~ite35_Out1564503399|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1564503399, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1564503399, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1564503399, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1564503399} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1564503399, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1564503399, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1564503399|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1564503399, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1564503399} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:08:23,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L777-->L778: Formula: (let ((.cse0 (= ~x$r_buff0_thd2~0_In-1605601860 ~x$r_buff0_thd2~0_Out-1605601860)) (.cse2 (= (mod ~x$w_buff0_used~0_In-1605601860 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-1605601860 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= 0 ~x$r_buff0_thd2~0_Out-1605601860) (not .cse2) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1605601860, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1605601860} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1605601860, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1605601860|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1605601860} AuxVars[] AssignedVars[~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:08:23,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In756290536 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In756290536 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In756290536 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In756290536 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out756290536|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$r_buff1_thd2~0_In756290536 |P1Thread1of1ForFork1_#t~ite37_Out756290536|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In756290536, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In756290536, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In756290536, ~x$w_buff0_used~0=~x$w_buff0_used~0_In756290536} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In756290536, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In756290536, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In756290536, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out756290536|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In756290536} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:08:23,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L778-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~x$r_buff1_thd2~0_154 |v_P1Thread1of1ForFork1_#t~ite37_20|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_20|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_154, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_19|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:08:23,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L732-->L732-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-729285326 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-729285326 256))) (.cse2 (= (mod ~x$r_buff1_thd1~0_In-729285326 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-729285326 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-729285326|)) (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-729285326 |P0Thread1of1ForFork0_#t~ite6_Out-729285326|) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-729285326, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-729285326, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-729285326, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-729285326} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-729285326|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-729285326, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-729285326, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-729285326, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-729285326} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:08:23,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L733-->L733-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1836888034 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1836888034 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out1836888034| ~x$r_buff0_thd1~0_In1836888034)) (and (= |P0Thread1of1ForFork0_#t~ite7_Out1836888034| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1836888034, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1836888034} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1836888034, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1836888034|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1836888034} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-11-28 18:08:23,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L734-->L734-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-1754190693 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1754190693 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1754190693 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-1754190693 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd1~0_In-1754190693 |P0Thread1of1ForFork0_#t~ite8_Out-1754190693|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1754190693|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1754190693, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1754190693, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1754190693, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1754190693} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1754190693, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1754190693|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1754190693, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1754190693, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1754190693} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:08:23,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L734-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_140 |v_P0Thread1of1ForFork0_#t~ite8_24|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_23|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_140} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-11-28 18:08:23,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L803-->L805-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~x$r_buff0_thd0~0_54 256)) (= 0 (mod v_~x$w_buff0_used~0_123 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_54, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_54, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:08:23,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [929] [929] L805-2-->L805-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1710390638 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-1710390638 256) 0))) (or (and (or .cse0 .cse1) (= ~x~0_In-1710390638 |ULTIMATE.start_main_#t~ite40_Out-1710390638|)) (and (not .cse1) (= ~x$w_buff1~0_In-1710390638 |ULTIMATE.start_main_#t~ite40_Out-1710390638|) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1710390638, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1710390638, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1710390638, ~x~0=~x~0_In-1710390638} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1710390638|, ~x$w_buff1~0=~x$w_buff1~0_In-1710390638, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1710390638, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1710390638, ~x~0=~x~0_In-1710390638} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:08:23,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L805-4-->L806: Formula: (= v_~x~0_51 |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_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~x~0=v_~x~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-11-28 18:08:23,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In2036185367 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In2036185367 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out2036185367| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite42_Out2036185367| ~x$w_buff0_used~0_In2036185367)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2036185367, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2036185367} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2036185367, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out2036185367|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2036185367} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:08:23,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L807-->L807-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd0~0_In-1087693761 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1087693761 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1087693761 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1087693761 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-1087693761|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-1087693761 |ULTIMATE.start_main_#t~ite43_Out-1087693761|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1087693761, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1087693761, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1087693761, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1087693761} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1087693761, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1087693761, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1087693761|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1087693761, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1087693761} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:08:23,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In531777714 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In531777714 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out531777714| 0)) (and (= ~x$r_buff0_thd0~0_In531777714 |ULTIMATE.start_main_#t~ite44_Out531777714|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In531777714, ~x$w_buff0_used~0=~x$w_buff0_used~0_In531777714} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In531777714, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out531777714|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In531777714} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:08:23,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd0~0_In-294258112 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-294258112 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-294258112 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-294258112 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-294258112| ~x$r_buff1_thd0~0_In-294258112) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-294258112|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-294258112, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-294258112, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-294258112, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-294258112} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-294258112, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-294258112, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-294258112, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-294258112|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-294258112} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:08:23,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In-1785703275 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite68_Out-1785703275| ~x$mem_tmp~0_In-1785703275) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite68_Out-1785703275| ~x~0_In-1785703275) .cse0))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-1785703275, ~x$mem_tmp~0=~x$mem_tmp~0_In-1785703275, ~x~0=~x~0_In-1785703275} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In-1785703275, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-1785703275|, ~x$mem_tmp~0=~x$mem_tmp~0_In-1785703275, ~x~0=~x~0_In-1785703275} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-11-28 18:08:23,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L824-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~x$flush_delayed~0_193 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= (mod v_~main$tmp_guard1~0_29 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= |v_ULTIMATE.start_main_#t~ite68_38| v_~x~0_259)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_38|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~x$flush_delayed~0=v_~x$flush_delayed~0_193, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_37|, ~x~0=v_~x~0_259, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite68, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:08:24,128 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:08:24,128 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:08:24,130 INFO L168 Benchmark]: Toolchain (without parser) took 29674.07 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 953.7 MB in the beginning and 537.9 MB in the end (delta: 415.7 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-11-28 18:08:24,131 INFO L168 Benchmark]: CDTParser took 0.30 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:24,131 INFO L168 Benchmark]: CACSL2BoogieTranslator took 809.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -136.9 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:08:24,132 INFO L168 Benchmark]: Boogie Procedure Inliner took 112.68 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:24,132 INFO L168 Benchmark]: Boogie Preprocessor took 81.28 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:24,132 INFO L168 Benchmark]: RCFGBuilder took 892.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:08:24,133 INFO L168 Benchmark]: TraceAbstraction took 27606.14 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 1.0 GB in the beginning and 562.6 MB in the end (delta: 458.0 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-11-28 18:08:24,133 INFO L168 Benchmark]: Witness Printer took 167.12 ms. Allocated memory is still 2.3 GB. Free memory was 562.6 MB in the beginning and 537.9 MB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:08:24,135 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.30 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 809.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -136.9 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 112.68 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 81.28 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 892.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27606.14 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 1.0 GB in the beginning and 562.6 MB in the end (delta: 458.0 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 167.12 ms. Allocated memory is still 2.3 GB. Free memory was 562.6 MB in the beginning and 537.9 MB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 189 ProgramPointsBefore, 112 ProgramPointsAfterwards, 244 TransitionsBefore, 137 TransitionsAfterwards, 25246 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 53 ConcurrentYvCompositions, 33 ChoiceCompositions, 10285 VarBasedMoverChecksPositive, 306 VarBasedMoverChecksNegative, 77 SemBasedMoverChecksPositive, 331 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 142941 CheckedPairsTotal, 118 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(&t599, ((void *)0), P0, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L799] FCALL, FORK 0 pthread_create(&t600, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L749] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L750] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L751] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L752] 2 x$r_buff0_thd2 = (_Bool)1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 x$flush_delayed = weak$$choice2 [L758] 2 x$mem_tmp = x 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=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L759] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) 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=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L759] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L760] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) 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=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L760] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L761] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) 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=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L762] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) 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=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L762] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L763] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)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=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L763] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)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=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] 2 x = x$flush_delayed ? x$mem_tmp : x [L768] 2 x$flush_delayed = (_Bool)0 [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 y = 1 [L727] 1 x = 1 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=7, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L730] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) 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=7, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L730] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L731] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L774] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L732] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L733] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [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=7, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L809] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L812] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 0 x$flush_delayed = weak$$choice2 [L815] 0 x$mem_tmp = x 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=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L816] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) 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=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L816] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L817] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) 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=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L817] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L818] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) 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=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L818] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L819] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) 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=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L819] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L820] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) 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=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L820] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) 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=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L821] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L822] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) 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=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L822] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L823] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) 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=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 183 locations, 2 error locations. Result: UNSAFE, OverallTime: 27.2s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3237 SDtfs, 3004 SDslu, 5958 SDs, 0 SdLazy, 3501 SolverSat, 159 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 25 SyntacticMatches, 28 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47611occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 25028 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 872 NumberOfCodeBlocks, 872 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 785 ConstructedInterpolants, 0 QuantifiedInterpolants, 116317 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...