./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix035_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/mix035_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 717e128ec3bb50286f22892f2788ed777cef8f9a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:12:43,981 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:12:43,983 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:12:44,004 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:12:44,004 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:12:44,007 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:12:44,009 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:12:44,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:12:44,026 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:12:44,030 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:12:44,031 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:12:44,034 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:12:44,034 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:12:44,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:12:44,039 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:12:44,040 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:12:44,042 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:12:44,043 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:12:44,046 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:12:44,050 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:12:44,055 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:12:44,060 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:12:44,061 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:12:44,064 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:12:44,068 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:12:44,069 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:12:44,069 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:12:44,071 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:12:44,072 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:12:44,073 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:12:44,073 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:12:44,074 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:12:44,075 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:12:44,076 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:12:44,078 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:12:44,078 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:12:44,079 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:12:44,080 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:12:44,080 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:12:44,081 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:12:44,082 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:12:44,083 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:12:44,117 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:12:44,121 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:12:44,122 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:12:44,123 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:12:44,123 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:12:44,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:12:44,125 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:12:44,125 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:12:44,126 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:12:44,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:12:44,127 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:12:44,127 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:12:44,128 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:12:44,128 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:12:44,129 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:12:44,129 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:12:44,129 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:12:44,129 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:12:44,130 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:12:44,130 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:12:44,130 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:12:44,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:12:44,131 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:12:44,131 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:12:44,132 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:12:44,132 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:12:44,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:12:44,133 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:12:44,133 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:12:44,133 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 -> 717e128ec3bb50286f22892f2788ed777cef8f9a [2019-11-28 18:12:44,444 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:12:44,463 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:12:44,468 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:12:44,469 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:12:44,470 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:12:44,471 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix035_tso.opt.i [2019-11-28 18:12:44,549 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68d9329de/e9ff7d1e215847a1b73681605db6d238/FLAG7ad23f744 [2019-11-28 18:12:45,157 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:12:45,158 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix035_tso.opt.i [2019-11-28 18:12:45,178 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68d9329de/e9ff7d1e215847a1b73681605db6d238/FLAG7ad23f744 [2019-11-28 18:12:45,421 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68d9329de/e9ff7d1e215847a1b73681605db6d238 [2019-11-28 18:12:45,424 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:12:45,426 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:12:45,427 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:12:45,427 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:12:45,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:12:45,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:12:45" (1/1) ... [2019-11-28 18:12:45,435 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a89df04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:45, skipping insertion in model container [2019-11-28 18:12:45,435 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:12:45" (1/1) ... [2019-11-28 18:12:45,443 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:12:45,486 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:12:45,981 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:12:45,993 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:12:46,069 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:12:46,158 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:12:46,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:46 WrapperNode [2019-11-28 18:12:46,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:12:46,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:12:46,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:12:46,161 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:12:46,171 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:12:46" (1/1) ... [2019-11-28 18:12:46,199 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:12:46" (1/1) ... [2019-11-28 18:12:46,231 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:12:46,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:12:46,232 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:12:46,233 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:12:46,241 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:46" (1/1) ... [2019-11-28 18:12:46,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:46" (1/1) ... [2019-11-28 18:12:46,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:46" (1/1) ... [2019-11-28 18:12:46,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:46" (1/1) ... [2019-11-28 18:12:46,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:46" (1/1) ... [2019-11-28 18:12:46,260 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:46" (1/1) ... [2019-11-28 18:12:46,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:46" (1/1) ... [2019-11-28 18:12:46,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:12:46,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:12:46,270 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:12:46,270 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:12:46,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:46" (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:12:46,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:12:46,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:12:46,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:12:46,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:12:46,337 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:12:46,337 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:12:46,338 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:12:46,338 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:12:46,338 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-11-28 18:12:46,339 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-11-28 18:12:46,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:12:46,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:12:46,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:12:46,341 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:12:47,020 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:12:47,020 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:12:47,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:12:47 BoogieIcfgContainer [2019-11-28 18:12:47,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:12:47,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:12:47,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:12:47,029 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:12:47,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:12:45" (1/3) ... [2019-11-28 18:12:47,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115e6c6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:12:47, skipping insertion in model container [2019-11-28 18:12:47,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:46" (2/3) ... [2019-11-28 18:12:47,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115e6c6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:12:47, skipping insertion in model container [2019-11-28 18:12:47,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:12:47" (3/3) ... [2019-11-28 18:12:47,036 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_tso.opt.i [2019-11-28 18:12:47,047 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:12:47,048 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:12:47,061 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:12:47,062 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:12:47,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,125 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,125 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,129 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,129 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,167 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,167 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,168 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,176 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,176 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:47,202 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-28 18:12:47,223 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:12:47,224 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:12:47,224 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:12:47,224 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:12:47,224 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:12:47,224 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:12:47,224 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:12:47,225 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:12:47,250 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 179 transitions [2019-11-28 18:12:47,252 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 154 places, 179 transitions [2019-11-28 18:12:47,363 INFO L134 PetriNetUnfolder]: 35/176 cut-off events. [2019-11-28 18:12:47,364 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:12:47,387 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 176 events. 35/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 576 event pairs. 9/148 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-11-28 18:12:47,410 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 154 places, 179 transitions [2019-11-28 18:12:47,500 INFO L134 PetriNetUnfolder]: 35/176 cut-off events. [2019-11-28 18:12:47,500 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:12:47,509 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 176 events. 35/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 576 event pairs. 9/148 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-11-28 18:12:47,528 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-11-28 18:12:47,529 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:12:52,710 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-11-28 18:12:52,839 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-28 18:12:52,867 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44280 [2019-11-28 18:12:52,868 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-11-28 18:12:52,872 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 71 places, 79 transitions [2019-11-28 18:12:53,765 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 12302 states. [2019-11-28 18:12:53,768 INFO L276 IsEmpty]: Start isEmpty. Operand 12302 states. [2019-11-28 18:12:53,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 18:12:53,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:53,776 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:53,777 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:53,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:53,784 INFO L82 PathProgramCache]: Analyzing trace with hash -941376449, now seen corresponding path program 1 times [2019-11-28 18:12:53,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:53,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364707677] [2019-11-28 18:12:53,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:54,088 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:12:54,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364707677] [2019-11-28 18:12:54,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:54,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:12:54,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953655524] [2019-11-28 18:12:54,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:54,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:54,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:54,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:54,118 INFO L87 Difference]: Start difference. First operand 12302 states. Second operand 3 states. [2019-11-28 18:12:54,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:54,443 INFO L93 Difference]: Finished difference Result 11966 states and 45788 transitions. [2019-11-28 18:12:54,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:54,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-28 18:12:54,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:54,592 INFO L225 Difference]: With dead ends: 11966 [2019-11-28 18:12:54,592 INFO L226 Difference]: Without dead ends: 11270 [2019-11-28 18:12:54,594 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:12:54,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11270 states. [2019-11-28 18:12:55,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11270 to 11270. [2019-11-28 18:12:55,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11270 states. [2019-11-28 18:12:55,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11270 states to 11270 states and 43054 transitions. [2019-11-28 18:12:55,393 INFO L78 Accepts]: Start accepts. Automaton has 11270 states and 43054 transitions. Word has length 7 [2019-11-28 18:12:55,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:55,396 INFO L462 AbstractCegarLoop]: Abstraction has 11270 states and 43054 transitions. [2019-11-28 18:12:55,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:55,396 INFO L276 IsEmpty]: Start isEmpty. Operand 11270 states and 43054 transitions. [2019-11-28 18:12:55,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 18:12:55,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:55,408 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:55,409 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:55,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:55,409 INFO L82 PathProgramCache]: Analyzing trace with hash -941453907, now seen corresponding path program 1 times [2019-11-28 18:12:55,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:55,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706029968] [2019-11-28 18:12:55,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:55,594 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:12:55,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706029968] [2019-11-28 18:12:55,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:55,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:55,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938015418] [2019-11-28 18:12:55,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:55,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:55,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:55,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:55,599 INFO L87 Difference]: Start difference. First operand 11270 states and 43054 transitions. Second operand 4 states. [2019-11-28 18:12:56,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:56,117 INFO L93 Difference]: Finished difference Result 16970 states and 62500 transitions. [2019-11-28 18:12:56,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:56,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-28 18:12:56,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:56,240 INFO L225 Difference]: With dead ends: 16970 [2019-11-28 18:12:56,240 INFO L226 Difference]: Without dead ends: 16944 [2019-11-28 18:12:56,241 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:12:56,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16944 states. [2019-11-28 18:12:56,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16944 to 15456. [2019-11-28 18:12:56,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15456 states. [2019-11-28 18:12:56,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15456 states to 15456 states and 57661 transitions. [2019-11-28 18:12:56,869 INFO L78 Accepts]: Start accepts. Automaton has 15456 states and 57661 transitions. Word has length 13 [2019-11-28 18:12:56,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:56,869 INFO L462 AbstractCegarLoop]: Abstraction has 15456 states and 57661 transitions. [2019-11-28 18:12:56,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:56,877 INFO L276 IsEmpty]: Start isEmpty. Operand 15456 states and 57661 transitions. [2019-11-28 18:12:56,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:12:56,883 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:56,885 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:56,885 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:56,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:56,886 INFO L82 PathProgramCache]: Analyzing trace with hash 166730424, now seen corresponding path program 1 times [2019-11-28 18:12:56,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:56,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910355143] [2019-11-28 18:12:56,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:56,964 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:12:56,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910355143] [2019-11-28 18:12:56,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:56,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:56,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237033455] [2019-11-28 18:12:56,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:56,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:56,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:56,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:56,966 INFO L87 Difference]: Start difference. First operand 15456 states and 57661 transitions. Second operand 3 states. [2019-11-28 18:12:57,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:57,133 INFO L93 Difference]: Finished difference Result 20134 states and 73756 transitions. [2019-11-28 18:12:57,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:57,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:12:57,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:57,218 INFO L225 Difference]: With dead ends: 20134 [2019-11-28 18:12:57,219 INFO L226 Difference]: Without dead ends: 20134 [2019-11-28 18:12:57,219 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:57,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20134 states. [2019-11-28 18:12:58,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20134 to 16742. [2019-11-28 18:12:58,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16742 states. [2019-11-28 18:12:58,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16742 states to 16742 states and 62266 transitions. [2019-11-28 18:12:58,071 INFO L78 Accepts]: Start accepts. Automaton has 16742 states and 62266 transitions. Word has length 16 [2019-11-28 18:12:58,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:58,072 INFO L462 AbstractCegarLoop]: Abstraction has 16742 states and 62266 transitions. [2019-11-28 18:12:58,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:58,072 INFO L276 IsEmpty]: Start isEmpty. Operand 16742 states and 62266 transitions. [2019-11-28 18:12:58,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:12:58,076 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:58,077 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:58,077 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:58,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:58,078 INFO L82 PathProgramCache]: Analyzing trace with hash 166596039, now seen corresponding path program 1 times [2019-11-28 18:12:58,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:58,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842370153] [2019-11-28 18:12:58,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:58,167 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:12:58,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842370153] [2019-11-28 18:12:58,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:58,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:58,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115563254] [2019-11-28 18:12:58,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:58,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:58,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:58,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:58,170 INFO L87 Difference]: Start difference. First operand 16742 states and 62266 transitions. Second operand 4 states. [2019-11-28 18:12:58,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:58,436 INFO L93 Difference]: Finished difference Result 20458 states and 74724 transitions. [2019-11-28 18:12:58,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:58,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-28 18:12:58,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:58,496 INFO L225 Difference]: With dead ends: 20458 [2019-11-28 18:12:58,496 INFO L226 Difference]: Without dead ends: 20438 [2019-11-28 18:12:58,497 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:12:58,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20438 states. [2019-11-28 18:12:59,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20438 to 17660. [2019-11-28 18:12:59,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17660 states. [2019-11-28 18:12:59,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17660 states to 17660 states and 65445 transitions. [2019-11-28 18:12:59,115 INFO L78 Accepts]: Start accepts. Automaton has 17660 states and 65445 transitions. Word has length 16 [2019-11-28 18:12:59,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:59,115 INFO L462 AbstractCegarLoop]: Abstraction has 17660 states and 65445 transitions. [2019-11-28 18:12:59,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:59,115 INFO L276 IsEmpty]: Start isEmpty. Operand 17660 states and 65445 transitions. [2019-11-28 18:12:59,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:12:59,120 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:59,120 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:59,120 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:59,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:59,120 INFO L82 PathProgramCache]: Analyzing trace with hash 289916209, now seen corresponding path program 1 times [2019-11-28 18:12:59,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:59,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195795756] [2019-11-28 18:12:59,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:59,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:59,177 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:12:59,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195795756] [2019-11-28 18:12:59,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:59,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:59,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882675422] [2019-11-28 18:12:59,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:59,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:59,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:59,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:59,179 INFO L87 Difference]: Start difference. First operand 17660 states and 65445 transitions. Second operand 4 states. [2019-11-28 18:12:59,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:59,819 INFO L93 Difference]: Finished difference Result 22396 states and 81911 transitions. [2019-11-28 18:12:59,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:59,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-28 18:12:59,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:59,884 INFO L225 Difference]: With dead ends: 22396 [2019-11-28 18:12:59,885 INFO L226 Difference]: Without dead ends: 22368 [2019-11-28 18:12:59,885 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:13:00,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22368 states. [2019-11-28 18:13:00,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22368 to 18470. [2019-11-28 18:13:00,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18470 states. [2019-11-28 18:13:00,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18470 states to 18470 states and 68496 transitions. [2019-11-28 18:13:00,482 INFO L78 Accepts]: Start accepts. Automaton has 18470 states and 68496 transitions. Word has length 16 [2019-11-28 18:13:00,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:13:00,482 INFO L462 AbstractCegarLoop]: Abstraction has 18470 states and 68496 transitions. [2019-11-28 18:13:00,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:13:00,483 INFO L276 IsEmpty]: Start isEmpty. Operand 18470 states and 68496 transitions. [2019-11-28 18:13:00,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 18:13:00,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:13:00,491 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:13:00,491 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:13:00,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:13:00,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1946092179, now seen corresponding path program 1 times [2019-11-28 18:13:00,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:13:00,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122087462] [2019-11-28 18:13:00,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:13:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:13:00,576 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:13:00,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122087462] [2019-11-28 18:13:00,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:13:00,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:13:00,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873639488] [2019-11-28 18:13:00,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:13:00,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:13:00,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:13:00,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:13:00,579 INFO L87 Difference]: Start difference. First operand 18470 states and 68496 transitions. Second operand 3 states. [2019-11-28 18:13:00,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:13:00,674 INFO L93 Difference]: Finished difference Result 18210 states and 67534 transitions. [2019-11-28 18:13:00,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:13:00,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 18:13:00,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:13:00,716 INFO L225 Difference]: With dead ends: 18210 [2019-11-28 18:13:00,716 INFO L226 Difference]: Without dead ends: 18210 [2019-11-28 18:13:00,716 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:13:00,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18210 states. [2019-11-28 18:13:01,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18210 to 18210. [2019-11-28 18:13:01,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18210 states. [2019-11-28 18:13:01,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18210 states to 18210 states and 67534 transitions. [2019-11-28 18:13:01,216 INFO L78 Accepts]: Start accepts. Automaton has 18210 states and 67534 transitions. Word has length 18 [2019-11-28 18:13:01,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:13:01,217 INFO L462 AbstractCegarLoop]: Abstraction has 18210 states and 67534 transitions. [2019-11-28 18:13:01,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:13:01,217 INFO L276 IsEmpty]: Start isEmpty. Operand 18210 states and 67534 transitions. [2019-11-28 18:13:01,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 18:13:01,229 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:13:01,229 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:13:01,229 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:13:01,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:13:01,230 INFO L82 PathProgramCache]: Analyzing trace with hash 2042402422, now seen corresponding path program 1 times [2019-11-28 18:13:01,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:13:01,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139656930] [2019-11-28 18:13:01,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:13:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:13:01,689 WARN L192 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-11-28 18:13:01,693 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:13:01,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139656930] [2019-11-28 18:13:01,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:13:01,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:13:01,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109407924] [2019-11-28 18:13:01,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:13:01,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:13:01,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:13:01,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:13:01,695 INFO L87 Difference]: Start difference. First operand 18210 states and 67534 transitions. Second operand 3 states. [2019-11-28 18:13:01,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:13:01,806 INFO L93 Difference]: Finished difference Result 17234 states and 62998 transitions. [2019-11-28 18:13:01,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:13:01,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 18:13:01,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:13:01,854 INFO L225 Difference]: With dead ends: 17234 [2019-11-28 18:13:01,855 INFO L226 Difference]: Without dead ends: 17234 [2019-11-28 18:13:01,855 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:13:01,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17234 states. [2019-11-28 18:13:02,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17234 to 16834. [2019-11-28 18:13:02,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16834 states. [2019-11-28 18:13:02,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16834 states to 16834 states and 61638 transitions. [2019-11-28 18:13:02,227 INFO L78 Accepts]: Start accepts. Automaton has 16834 states and 61638 transitions. Word has length 19 [2019-11-28 18:13:02,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:13:02,227 INFO L462 AbstractCegarLoop]: Abstraction has 16834 states and 61638 transitions. [2019-11-28 18:13:02,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:13:02,227 INFO L276 IsEmpty]: Start isEmpty. Operand 16834 states and 61638 transitions. [2019-11-28 18:13:02,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 18:13:02,237 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:13:02,237 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] [2019-11-28 18:13:02,238 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:13:02,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:13:02,238 INFO L82 PathProgramCache]: Analyzing trace with hash -815902516, now seen corresponding path program 1 times [2019-11-28 18:13:02,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:13:02,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410446897] [2019-11-28 18:13:02,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:13:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:13:02,280 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:13:02,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410446897] [2019-11-28 18:13:02,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:13:02,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:13:02,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017587100] [2019-11-28 18:13:02,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:13:02,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:13:02,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:13:02,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:13:02,282 INFO L87 Difference]: Start difference. First operand 16834 states and 61638 transitions. Second operand 3 states. [2019-11-28 18:13:02,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:13:02,329 INFO L93 Difference]: Finished difference Result 9767 states and 31138 transitions. [2019-11-28 18:13:02,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:13:02,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 18:13:02,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:13:02,345 INFO L225 Difference]: With dead ends: 9767 [2019-11-28 18:13:02,345 INFO L226 Difference]: Without dead ends: 9767 [2019-11-28 18:13:02,346 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:13:02,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2019-11-28 18:13:02,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 9767. [2019-11-28 18:13:02,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9767 states. [2019-11-28 18:13:02,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 31138 transitions. [2019-11-28 18:13:02,530 INFO L78 Accepts]: Start accepts. Automaton has 9767 states and 31138 transitions. Word has length 20 [2019-11-28 18:13:02,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:13:02,530 INFO L462 AbstractCegarLoop]: Abstraction has 9767 states and 31138 transitions. [2019-11-28 18:13:02,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:13:02,531 INFO L276 IsEmpty]: Start isEmpty. Operand 9767 states and 31138 transitions. [2019-11-28 18:13:02,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 18:13:02,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:13:02,536 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] [2019-11-28 18:13:02,537 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:13:02,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:13:02,537 INFO L82 PathProgramCache]: Analyzing trace with hash 2077257817, now seen corresponding path program 1 times [2019-11-28 18:13:02,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:13:02,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307690590] [2019-11-28 18:13:02,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:13:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:13:02,585 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:13:02,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307690590] [2019-11-28 18:13:02,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:13:02,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:13:02,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966775775] [2019-11-28 18:13:02,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:13:02,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:13:02,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:13:02,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:13:02,587 INFO L87 Difference]: Start difference. First operand 9767 states and 31138 transitions. Second operand 4 states. [2019-11-28 18:13:02,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:13:02,610 INFO L93 Difference]: Finished difference Result 1943 states and 5093 transitions. [2019-11-28 18:13:02,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:13:02,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-11-28 18:13:02,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:13:02,613 INFO L225 Difference]: With dead ends: 1943 [2019-11-28 18:13:02,614 INFO L226 Difference]: Without dead ends: 1943 [2019-11-28 18:13:02,614 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:13:02,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2019-11-28 18:13:02,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1943. [2019-11-28 18:13:02,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1943 states. [2019-11-28 18:13:02,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1943 states to 1943 states and 5093 transitions. [2019-11-28 18:13:02,638 INFO L78 Accepts]: Start accepts. Automaton has 1943 states and 5093 transitions. Word has length 21 [2019-11-28 18:13:02,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:13:02,638 INFO L462 AbstractCegarLoop]: Abstraction has 1943 states and 5093 transitions. [2019-11-28 18:13:02,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:13:02,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1943 states and 5093 transitions. [2019-11-28 18:13:02,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 18:13:02,641 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:13:02,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] [2019-11-28 18:13:02,641 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:13:02,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:13:02,642 INFO L82 PathProgramCache]: Analyzing trace with hash -45017831, now seen corresponding path program 1 times [2019-11-28 18:13:02,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:13:02,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467785747] [2019-11-28 18:13:02,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:13:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:13:02,704 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:13:02,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467785747] [2019-11-28 18:13:02,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:13:02,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:13:02,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054322045] [2019-11-28 18:13:02,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:13:02,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:13:02,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:13:02,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:13:02,707 INFO L87 Difference]: Start difference. First operand 1943 states and 5093 transitions. Second operand 5 states. [2019-11-28 18:13:02,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:13:02,916 INFO L93 Difference]: Finished difference Result 2686 states and 6864 transitions. [2019-11-28 18:13:02,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:13:02,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-28 18:13:02,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:13:02,923 INFO L225 Difference]: With dead ends: 2686 [2019-11-28 18:13:02,923 INFO L226 Difference]: Without dead ends: 2684 [2019-11-28 18:13:02,924 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:13:02,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2019-11-28 18:13:02,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2095. [2019-11-28 18:13:02,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2095 states. [2019-11-28 18:13:02,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2095 states to 2095 states and 5475 transitions. [2019-11-28 18:13:02,967 INFO L78 Accepts]: Start accepts. Automaton has 2095 states and 5475 transitions. Word has length 29 [2019-11-28 18:13:02,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:13:02,969 INFO L462 AbstractCegarLoop]: Abstraction has 2095 states and 5475 transitions. [2019-11-28 18:13:02,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:13:02,969 INFO L276 IsEmpty]: Start isEmpty. Operand 2095 states and 5475 transitions. [2019-11-28 18:13:02,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 18:13:02,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:13:02,974 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] [2019-11-28 18:13:02,974 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:13:02,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:13:02,974 INFO L82 PathProgramCache]: Analyzing trace with hash 856751491, now seen corresponding path program 1 times [2019-11-28 18:13:02,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:13:02,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221787137] [2019-11-28 18:13:02,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:13:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:13:03,007 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:13:03,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221787137] [2019-11-28 18:13:03,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:13:03,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:13:03,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51053918] [2019-11-28 18:13:03,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:13:03,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:13:03,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:13:03,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:13:03,009 INFO L87 Difference]: Start difference. First operand 2095 states and 5475 transitions. Second operand 3 states. [2019-11-28 18:13:03,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:13:03,053 INFO L93 Difference]: Finished difference Result 2610 states and 6578 transitions. [2019-11-28 18:13:03,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:13:03,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-28 18:13:03,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:13:03,058 INFO L225 Difference]: With dead ends: 2610 [2019-11-28 18:13:03,058 INFO L226 Difference]: Without dead ends: 2610 [2019-11-28 18:13:03,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:13:03,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2019-11-28 18:13:03,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2137. [2019-11-28 18:13:03,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2137 states. [2019-11-28 18:13:03,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 5406 transitions. [2019-11-28 18:13:03,099 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 5406 transitions. Word has length 29 [2019-11-28 18:13:03,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:13:03,099 INFO L462 AbstractCegarLoop]: Abstraction has 2137 states and 5406 transitions. [2019-11-28 18:13:03,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:13:03,100 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 5406 transitions. [2019-11-28 18:13:03,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 18:13:03,105 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:13:03,105 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] [2019-11-28 18:13:03,105 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:13:03,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:13:03,107 INFO L82 PathProgramCache]: Analyzing trace with hash -85244973, now seen corresponding path program 1 times [2019-11-28 18:13:03,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:13:03,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143382806] [2019-11-28 18:13:03,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:13:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:13:03,198 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:13:03,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143382806] [2019-11-28 18:13:03,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:13:03,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:13:03,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961391521] [2019-11-28 18:13:03,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:13:03,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:13:03,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:13:03,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:13:03,200 INFO L87 Difference]: Start difference. First operand 2137 states and 5406 transitions. Second operand 5 states. [2019-11-28 18:13:03,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:13:03,387 INFO L93 Difference]: Finished difference Result 2625 states and 6552 transitions. [2019-11-28 18:13:03,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:13:03,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 18:13:03,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:13:03,391 INFO L225 Difference]: With dead ends: 2625 [2019-11-28 18:13:03,392 INFO L226 Difference]: Without dead ends: 2623 [2019-11-28 18:13:03,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:13:03,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2019-11-28 18:13:03,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 2017. [2019-11-28 18:13:03,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2017 states. [2019-11-28 18:13:03,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 5107 transitions. [2019-11-28 18:13:03,419 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 5107 transitions. Word has length 30 [2019-11-28 18:13:03,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:13:03,419 INFO L462 AbstractCegarLoop]: Abstraction has 2017 states and 5107 transitions. [2019-11-28 18:13:03,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:13:03,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 5107 transitions. [2019-11-28 18:13:03,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 18:13:03,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:13:03,422 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] [2019-11-28 18:13:03,422 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:13:03,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:13:03,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1272719188, now seen corresponding path program 1 times [2019-11-28 18:13:03,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:13:03,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853844148] [2019-11-28 18:13:03,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:13:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:13:03,493 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:13:03,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853844148] [2019-11-28 18:13:03,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:13:03,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:13:03,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396026330] [2019-11-28 18:13:03,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:13:03,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:13:03,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:13:03,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:13:03,495 INFO L87 Difference]: Start difference. First operand 2017 states and 5107 transitions. Second operand 4 states. [2019-11-28 18:13:03,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:13:03,540 INFO L93 Difference]: Finished difference Result 3159 states and 7707 transitions. [2019-11-28 18:13:03,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:13:03,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-11-28 18:13:03,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:13:03,547 INFO L225 Difference]: With dead ends: 3159 [2019-11-28 18:13:03,547 INFO L226 Difference]: Without dead ends: 1816 [2019-11-28 18:13:03,547 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:13:03,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2019-11-28 18:13:03,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1816. [2019-11-28 18:13:03,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1816 states. [2019-11-28 18:13:03,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 4528 transitions. [2019-11-28 18:13:03,576 INFO L78 Accepts]: Start accepts. Automaton has 1816 states and 4528 transitions. Word has length 30 [2019-11-28 18:13:03,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:13:03,577 INFO L462 AbstractCegarLoop]: Abstraction has 1816 states and 4528 transitions. [2019-11-28 18:13:03,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:13:03,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 4528 transitions. [2019-11-28 18:13:03,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 18:13:03,580 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:13:03,580 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] [2019-11-28 18:13:03,581 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:13:03,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:13:03,583 INFO L82 PathProgramCache]: Analyzing trace with hash 811227948, now seen corresponding path program 2 times [2019-11-28 18:13:03,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:13:03,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077895304] [2019-11-28 18:13:03,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:13:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:13:03,668 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:13:03,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077895304] [2019-11-28 18:13:03,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:13:03,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:13:03,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108237544] [2019-11-28 18:13:03,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:13:03,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:13:03,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:13:03,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:13:03,672 INFO L87 Difference]: Start difference. First operand 1816 states and 4528 transitions. Second operand 5 states. [2019-11-28 18:13:03,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:13:03,712 INFO L93 Difference]: Finished difference Result 1067 states and 2754 transitions. [2019-11-28 18:13:03,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:13:03,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 18:13:03,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:13:03,716 INFO L225 Difference]: With dead ends: 1067 [2019-11-28 18:13:03,716 INFO L226 Difference]: Without dead ends: 1067 [2019-11-28 18:13:03,717 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:13:03,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2019-11-28 18:13:03,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1067. [2019-11-28 18:13:03,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1067 states. [2019-11-28 18:13:03,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 2754 transitions. [2019-11-28 18:13:03,734 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 2754 transitions. Word has length 30 [2019-11-28 18:13:03,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:13:03,735 INFO L462 AbstractCegarLoop]: Abstraction has 1067 states and 2754 transitions. [2019-11-28 18:13:03,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:13:03,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 2754 transitions. [2019-11-28 18:13:03,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:13:03,738 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:13:03,738 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] [2019-11-28 18:13:03,738 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:13:03,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:13:03,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1592357669, now seen corresponding path program 1 times [2019-11-28 18:13:03,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:13:03,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982750725] [2019-11-28 18:13:03,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:13:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:13:03,900 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:13:03,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982750725] [2019-11-28 18:13:03,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:13:03,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:13:03,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802156495] [2019-11-28 18:13:03,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:13:03,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:13:03,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:13:03,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:13:03,903 INFO L87 Difference]: Start difference. First operand 1067 states and 2754 transitions. Second operand 5 states. [2019-11-28 18:13:03,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:13:03,943 INFO L93 Difference]: Finished difference Result 1463 states and 3623 transitions. [2019-11-28 18:13:03,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:13:03,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-28 18:13:03,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:13:03,944 INFO L225 Difference]: With dead ends: 1463 [2019-11-28 18:13:03,944 INFO L226 Difference]: Without dead ends: 428 [2019-11-28 18:13:03,946 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:13:03,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-11-28 18:13:03,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2019-11-28 18:13:03,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-11-28 18:13:03,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 924 transitions. [2019-11-28 18:13:03,952 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 924 transitions. Word has length 45 [2019-11-28 18:13:03,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:13:03,953 INFO L462 AbstractCegarLoop]: Abstraction has 428 states and 924 transitions. [2019-11-28 18:13:03,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:13:03,953 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 924 transitions. [2019-11-28 18:13:03,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:13:03,954 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:13:03,955 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] [2019-11-28 18:13:03,955 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:13:03,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:13:03,955 INFO L82 PathProgramCache]: Analyzing trace with hash -252375621, now seen corresponding path program 2 times [2019-11-28 18:13:03,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:13:03,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602763234] [2019-11-28 18:13:03,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:13:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:13:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:13:04,108 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:13:04,110 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:13:04,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_76| 0 0))) (and (= 0 v_~weak$$choice0~0_10) (= v_~y$w_buff1~0_255 0) (= 0 v_~y$w_buff0~0_383) (= v_~a~0_43 0) (= v_~y$r_buff0_thd1~0_30 0) (= 0 v_~y$read_delayed_var~0.offset_8) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t934~0.base_38|)) (= v_~y$w_buff0_used~0_658 0) (= 0 v_~__unbuffered_p0_EAX~0_49) (= v_~z~0_82 0) (= v_~y$read_delayed~0_8 0) (= v_~x~0_24 0) (= v_~weak$$choice2~0_156 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t934~0.base_38| 4)) (= v_~__unbuffered_cnt~0_101 0) (= 0 v_~y$r_buff1_thd2~0_256) (= v_~y$w_buff1_used~0_429 0) (= 0 v_~y$r_buff0_thd3~0_155) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~y$flush_delayed~0_35) (= 0 |v_#NULL.base_4|) (= v_~main$tmp_guard0~0_20 0) (= 0 v_~__unbuffered_p1_EAX~0_63) (= 0 v_~__unbuffered_p2_EAX~0_107) (= (store .cse0 |v_ULTIMATE.start_main_~#t934~0.base_38| 1) |v_#valid_74|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t934~0.base_38| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t934~0.base_38|) |v_ULTIMATE.start_main_~#t934~0.offset_26| 0)) |v_#memory_int_17|) (= v_~y$mem_tmp~0_12 0) (= v_~y~0_134 0) (= |v_#NULL.offset_4| 0) (= 0 v_~y$read_delayed_var~0.base_8) (= |v_ULTIMATE.start_main_~#t934~0.offset_26| 0) (= 0 v_~y$r_buff0_thd2~0_301) (= v_~y$r_buff1_thd0~0_160 0) (= v_~__unbuffered_p2_EBX~0_107 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t934~0.base_38|) (= 0 v_~y$r_buff1_thd1~0_80) (= 0 v_~y$r_buff1_thd3~0_129) (= v_~y$r_buff0_thd0~0_90 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_18|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_20|, #NULL.offset=|v_#NULL.offset_4|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_43, ULTIMATE.start_main_~#t935~0.base=|v_ULTIMATE.start_main_~#t935~0.base_40|, ~y$mem_tmp~0=v_~y$mem_tmp~0_12, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_129, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_63, ULTIMATE.start_main_~#t936~0.offset=|v_ULTIMATE.start_main_~#t936~0.offset_19|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_30, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_107, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_107, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_32|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_68|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_34|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_79|, ~y$w_buff1~0=v_~y$w_buff1~0_255, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_301, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_160, ~x~0=v_~x~0_24, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_658, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_11|, ULTIMATE.start_main_~#t935~0.offset=|v_ULTIMATE.start_main_~#t935~0.offset_27|, ULTIMATE.start_main_~#t936~0.base=|v_ULTIMATE.start_main_~#t936~0.base_32|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_80, ~y$w_buff0~0=v_~y$w_buff0~0_383, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_155, ~y~0=v_~y~0_134, ULTIMATE.start_main_~#t934~0.base=|v_ULTIMATE.start_main_~#t934~0.base_38|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_66|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_66|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_256, ULTIMATE.start_main_~#t934~0.offset=|v_ULTIMATE.start_main_~#t934~0.offset_26|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_90, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_82, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_429} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, #NULL.offset, ~y$read_delayed~0, ~a~0, ULTIMATE.start_main_~#t935~0.base, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t936~0.offset, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t935~0.offset, ULTIMATE.start_main_~#t936~0.base, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t934~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t934~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:13:04,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L822-1-->L824: Formula: (and (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t935~0.base_13|)) (= |v_ULTIMATE.start_main_~#t935~0.offset_11| 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t935~0.base_13| 4) |v_#length_17|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t935~0.base_13| 1) |v_#valid_38|) (not (= 0 |v_ULTIMATE.start_main_~#t935~0.base_13|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t935~0.base_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t935~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t935~0.base_13|) |v_ULTIMATE.start_main_~#t935~0.offset_11| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t935~0.base=|v_ULTIMATE.start_main_~#t935~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t935~0.offset=|v_ULTIMATE.start_main_~#t935~0.offset_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t935~0.base, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t935~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-11-28 18:13:04,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L824-1-->L826: Formula: (and (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t936~0.base_12| 1)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t936~0.base_12| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t936~0.base_12|) (= |v_ULTIMATE.start_main_~#t936~0.offset_10| 0) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t936~0.base_12|) 0) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t936~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t936~0.base_12|) |v_ULTIMATE.start_main_~#t936~0.offset_10| 2)) |v_#memory_int_9|) (not (= |v_ULTIMATE.start_main_~#t936~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t936~0.offset=|v_ULTIMATE.start_main_~#t936~0.offset_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t936~0.base=|v_ULTIMATE.start_main_~#t936~0.base_12|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t936~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t936~0.base, #length] because there is no mapped edge [2019-11-28 18:13:04,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [606] [606] L4-->L799: Formula: (and (= v_~y$r_buff0_thd3~0_16 v_~y$r_buff1_thd3~0_10) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_4)) (= v_~__unbuffered_p2_EBX~0_4 v_~a~0_4) (= 1 v_~z~0_3) (= v_~y$r_buff0_thd0~0_18 v_~y$r_buff1_thd0~0_10) (= v_~y$r_buff1_thd1~0_3 v_~y$r_buff0_thd1~0_3) (= v_~__unbuffered_p2_EAX~0_4 v_~z~0_3) (= v_~y$r_buff0_thd3~0_15 1) (= v_~y$r_buff0_thd2~0_37 v_~y$r_buff1_thd2~0_23)) InVars {~a~0=v_~a~0_4, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_16, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_18, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_3, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_4} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_4, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_23, ~a~0=v_~a~0_4, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_3, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_10, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_15, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_18, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_4, ~z~0=v_~z~0_3, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:13:04,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_18 v_~__unbuffered_p0_EAX~0_19) (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= v_P0Thread1of1ForFork0_~arg.base_13 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= v_~a~0_27 1) (= v_P0Thread1of1ForFork0_~arg.offset_13 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, ~x~0=v_~x~0_18} OutVars{~a~0=v_~a~0_27, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_19, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_13, ~x~0=v_~x~0_18, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_13} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:13:04,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L758-->L758-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1688609799 256) 0))) (or (and (= ~y$w_buff0~0_In1688609799 |P1Thread1of1ForFork1_#t~ite8_Out1688609799|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1688609799 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In1688609799 256)) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In1688609799 256))) (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1688609799 256))))) .cse1 (= |P1Thread1of1ForFork1_#t~ite9_Out1688609799| |P1Thread1of1ForFork1_#t~ite8_Out1688609799|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out1688609799| ~y$w_buff0~0_In1688609799) (= |P1Thread1of1ForFork1_#t~ite8_In1688609799| |P1Thread1of1ForFork1_#t~ite8_Out1688609799|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1688609799, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1688609799, ~y$w_buff0~0=~y$w_buff0~0_In1688609799, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1688609799, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In1688609799|, ~weak$$choice2~0=~weak$$choice2~0_In1688609799, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1688609799} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1688609799, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1688609799, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1688609799|, ~y$w_buff0~0=~y$w_buff0~0_In1688609799, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1688609799, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out1688609799|, ~weak$$choice2~0=~weak$$choice2~0_In1688609799, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1688609799} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-11-28 18:13:04,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L762-->L763: Formula: (and (not (= (mod v_~weak$$choice2~0_22 256) 0)) (= v_~y$r_buff0_thd2~0_85 v_~y$r_buff0_thd2~0_84)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_14|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_10|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_84, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_22} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:13:04,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In677546982 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite23_In677546982| |P1Thread1of1ForFork1_#t~ite23_Out677546982|) (not .cse0) (= ~y$r_buff1_thd2~0_In677546982 |P1Thread1of1ForFork1_#t~ite24_Out677546982|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite24_Out677546982| |P1Thread1of1ForFork1_#t~ite23_Out677546982|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In677546982 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In677546982 256) 0)) (= (mod ~y$w_buff0_used~0_In677546982 256) 0) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In677546982 256) 0)))) (= ~y$r_buff1_thd2~0_In677546982 |P1Thread1of1ForFork1_#t~ite23_Out677546982|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In677546982, ~y$w_buff0_used~0=~y$w_buff0_used~0_In677546982, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In677546982, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In677546982|, ~weak$$choice2~0=~weak$$choice2~0_In677546982, ~y$w_buff1_used~0=~y$w_buff1_used~0_In677546982} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In677546982, ~y$w_buff0_used~0=~y$w_buff0_used~0_In677546982, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In677546982, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out677546982|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out677546982|, ~weak$$choice2~0=~weak$$choice2~0_In677546982, ~y$w_buff1_used~0=~y$w_buff1_used~0_In677546982} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-11-28 18:13:04,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [615] [615] L765-->L773: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256))) (= v_~y~0_14 v_~y$mem_tmp~0_4)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~y~0=v_~y~0_14, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-11-28 18:13:04,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In2142462432 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2142462432 256)))) (or (and (= ~y$w_buff0_used~0_In2142462432 |P2Thread1of1ForFork2_#t~ite28_Out2142462432|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite28_Out2142462432|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2142462432, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2142462432} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2142462432, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2142462432, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out2142462432|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-11-28 18:13:04,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L801-->L801-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In1888349068 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd3~0_In1888349068 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1888349068 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1888349068 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite29_Out1888349068|)) (and (= ~y$w_buff1_used~0_In1888349068 |P2Thread1of1ForFork2_#t~ite29_Out1888349068|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1888349068, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1888349068, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1888349068, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1888349068} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1888349068, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1888349068, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1888349068, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1888349068|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1888349068} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-11-28 18:13:04,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L802-->L803: Formula: (let ((.cse1 (= ~y$r_buff0_thd3~0_Out1818007480 ~y$r_buff0_thd3~0_In1818007480)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1818007480 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In1818007480 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= ~y$r_buff0_thd3~0_Out1818007480 0) (not .cse0) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1818007480, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1818007480} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1818007480, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out1818007480|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1818007480} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-11-28 18:13:04,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-2042685201 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-2042685201 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2042685201 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In-2042685201 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite31_Out-2042685201|)) (and (= ~y$r_buff1_thd3~0_In-2042685201 |P2Thread1of1ForFork2_#t~ite31_Out-2042685201|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2042685201, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2042685201, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2042685201, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2042685201} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2042685201, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2042685201, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-2042685201|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2042685201, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2042685201} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-11-28 18:13:04,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L803-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_26| v_~y$r_buff1_thd3~0_47)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_47, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_25|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-11-28 18:13:04,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [610] [610] L826-1-->L832: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:13:04,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L832-2-->L832-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-759420746 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-759420746 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite35_Out-759420746| ~y$w_buff1~0_In-759420746) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite35_Out-759420746| ~y~0_In-759420746)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-759420746, ~y~0=~y~0_In-759420746, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-759420746, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-759420746} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-759420746, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-759420746|, ~y~0=~y~0_In-759420746, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-759420746, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-759420746} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-11-28 18:13:04,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L832-4-->L833: Formula: (= v_~y~0_55 |v_ULTIMATE.start_main_#t~ite35_32|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_32|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ~y~0=v_~y~0_55} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-11-28 18:13:04,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In372821735 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In372821735 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite37_Out372821735| 0)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In372821735 |ULTIMATE.start_main_#t~ite37_Out372821735|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In372821735, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In372821735} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In372821735, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In372821735, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out372821735|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:13:04,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-1749278209 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1749278209 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1749278209 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1749278209 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-1749278209| ~y$w_buff1_used~0_In-1749278209) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite38_Out-1749278209|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1749278209, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1749278209, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1749278209, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1749278209} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1749278209, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1749278209, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1749278209|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1749278209, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1749278209} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:13:04,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L835-->L835-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In112809775 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In112809775 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In112809775 |ULTIMATE.start_main_#t~ite39_Out112809775|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite39_Out112809775|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In112809775, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In112809775} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In112809775, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out112809775|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In112809775} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:13:04,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L836-->L836-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In99804355 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In99804355 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In99804355 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In99804355 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite40_Out99804355|)) (and (= ~y$r_buff1_thd0~0_In99804355 |ULTIMATE.start_main_#t~ite40_Out99804355|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In99804355, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In99804355, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In99804355, ~y$w_buff1_used~0=~y$w_buff1_used~0_In99804355} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out99804355|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In99804355, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In99804355, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In99804355, ~y$w_buff1_used~0=~y$w_buff1_used~0_In99804355} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:13:04,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|) (= v_~y$r_buff1_thd0~0_131 |v_ULTIMATE.start_main_#t~ite40_46|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_84 0) (= 1 v_~__unbuffered_p2_EAX~0_84) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~__unbuffered_p0_EAX~0_34))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_84, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_84} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_84, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_84, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_131, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:13:04,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:13:04 BasicIcfg [2019-11-28 18:13:04,257 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:13:04,258 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:13:04,258 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:13:04,258 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:13:04,259 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:12:47" (3/4) ... [2019-11-28 18:13:04,261 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:13:04,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_76| 0 0))) (and (= 0 v_~weak$$choice0~0_10) (= v_~y$w_buff1~0_255 0) (= 0 v_~y$w_buff0~0_383) (= v_~a~0_43 0) (= v_~y$r_buff0_thd1~0_30 0) (= 0 v_~y$read_delayed_var~0.offset_8) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t934~0.base_38|)) (= v_~y$w_buff0_used~0_658 0) (= 0 v_~__unbuffered_p0_EAX~0_49) (= v_~z~0_82 0) (= v_~y$read_delayed~0_8 0) (= v_~x~0_24 0) (= v_~weak$$choice2~0_156 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t934~0.base_38| 4)) (= v_~__unbuffered_cnt~0_101 0) (= 0 v_~y$r_buff1_thd2~0_256) (= v_~y$w_buff1_used~0_429 0) (= 0 v_~y$r_buff0_thd3~0_155) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~y$flush_delayed~0_35) (= 0 |v_#NULL.base_4|) (= v_~main$tmp_guard0~0_20 0) (= 0 v_~__unbuffered_p1_EAX~0_63) (= 0 v_~__unbuffered_p2_EAX~0_107) (= (store .cse0 |v_ULTIMATE.start_main_~#t934~0.base_38| 1) |v_#valid_74|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t934~0.base_38| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t934~0.base_38|) |v_ULTIMATE.start_main_~#t934~0.offset_26| 0)) |v_#memory_int_17|) (= v_~y$mem_tmp~0_12 0) (= v_~y~0_134 0) (= |v_#NULL.offset_4| 0) (= 0 v_~y$read_delayed_var~0.base_8) (= |v_ULTIMATE.start_main_~#t934~0.offset_26| 0) (= 0 v_~y$r_buff0_thd2~0_301) (= v_~y$r_buff1_thd0~0_160 0) (= v_~__unbuffered_p2_EBX~0_107 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t934~0.base_38|) (= 0 v_~y$r_buff1_thd1~0_80) (= 0 v_~y$r_buff1_thd3~0_129) (= v_~y$r_buff0_thd0~0_90 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_18|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_20|, #NULL.offset=|v_#NULL.offset_4|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_43, ULTIMATE.start_main_~#t935~0.base=|v_ULTIMATE.start_main_~#t935~0.base_40|, ~y$mem_tmp~0=v_~y$mem_tmp~0_12, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_129, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_63, ULTIMATE.start_main_~#t936~0.offset=|v_ULTIMATE.start_main_~#t936~0.offset_19|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_30, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_107, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_107, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_32|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_68|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_34|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_79|, ~y$w_buff1~0=v_~y$w_buff1~0_255, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_301, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_160, ~x~0=v_~x~0_24, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_658, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_11|, ULTIMATE.start_main_~#t935~0.offset=|v_ULTIMATE.start_main_~#t935~0.offset_27|, ULTIMATE.start_main_~#t936~0.base=|v_ULTIMATE.start_main_~#t936~0.base_32|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_80, ~y$w_buff0~0=v_~y$w_buff0~0_383, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_155, ~y~0=v_~y~0_134, ULTIMATE.start_main_~#t934~0.base=|v_ULTIMATE.start_main_~#t934~0.base_38|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_66|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_66|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_256, ULTIMATE.start_main_~#t934~0.offset=|v_ULTIMATE.start_main_~#t934~0.offset_26|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_90, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_82, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_429} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, #NULL.offset, ~y$read_delayed~0, ~a~0, ULTIMATE.start_main_~#t935~0.base, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t936~0.offset, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t935~0.offset, ULTIMATE.start_main_~#t936~0.base, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t934~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t934~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:13:04,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L822-1-->L824: Formula: (and (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t935~0.base_13|)) (= |v_ULTIMATE.start_main_~#t935~0.offset_11| 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t935~0.base_13| 4) |v_#length_17|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t935~0.base_13| 1) |v_#valid_38|) (not (= 0 |v_ULTIMATE.start_main_~#t935~0.base_13|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t935~0.base_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t935~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t935~0.base_13|) |v_ULTIMATE.start_main_~#t935~0.offset_11| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t935~0.base=|v_ULTIMATE.start_main_~#t935~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t935~0.offset=|v_ULTIMATE.start_main_~#t935~0.offset_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t935~0.base, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t935~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-11-28 18:13:04,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L824-1-->L826: Formula: (and (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t936~0.base_12| 1)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t936~0.base_12| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t936~0.base_12|) (= |v_ULTIMATE.start_main_~#t936~0.offset_10| 0) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t936~0.base_12|) 0) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t936~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t936~0.base_12|) |v_ULTIMATE.start_main_~#t936~0.offset_10| 2)) |v_#memory_int_9|) (not (= |v_ULTIMATE.start_main_~#t936~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t936~0.offset=|v_ULTIMATE.start_main_~#t936~0.offset_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t936~0.base=|v_ULTIMATE.start_main_~#t936~0.base_12|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t936~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t936~0.base, #length] because there is no mapped edge [2019-11-28 18:13:04,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [606] [606] L4-->L799: Formula: (and (= v_~y$r_buff0_thd3~0_16 v_~y$r_buff1_thd3~0_10) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_4)) (= v_~__unbuffered_p2_EBX~0_4 v_~a~0_4) (= 1 v_~z~0_3) (= v_~y$r_buff0_thd0~0_18 v_~y$r_buff1_thd0~0_10) (= v_~y$r_buff1_thd1~0_3 v_~y$r_buff0_thd1~0_3) (= v_~__unbuffered_p2_EAX~0_4 v_~z~0_3) (= v_~y$r_buff0_thd3~0_15 1) (= v_~y$r_buff0_thd2~0_37 v_~y$r_buff1_thd2~0_23)) InVars {~a~0=v_~a~0_4, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_16, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_18, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_3, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_4} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_4, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_23, ~a~0=v_~a~0_4, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_3, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_10, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_15, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_18, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_4, ~z~0=v_~z~0_3, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:13:04,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_18 v_~__unbuffered_p0_EAX~0_19) (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= v_P0Thread1of1ForFork0_~arg.base_13 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= v_~a~0_27 1) (= v_P0Thread1of1ForFork0_~arg.offset_13 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, ~x~0=v_~x~0_18} OutVars{~a~0=v_~a~0_27, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_19, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_13, ~x~0=v_~x~0_18, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_13} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:13:04,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L758-->L758-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1688609799 256) 0))) (or (and (= ~y$w_buff0~0_In1688609799 |P1Thread1of1ForFork1_#t~ite8_Out1688609799|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1688609799 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In1688609799 256)) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In1688609799 256))) (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1688609799 256))))) .cse1 (= |P1Thread1of1ForFork1_#t~ite9_Out1688609799| |P1Thread1of1ForFork1_#t~ite8_Out1688609799|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out1688609799| ~y$w_buff0~0_In1688609799) (= |P1Thread1of1ForFork1_#t~ite8_In1688609799| |P1Thread1of1ForFork1_#t~ite8_Out1688609799|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1688609799, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1688609799, ~y$w_buff0~0=~y$w_buff0~0_In1688609799, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1688609799, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In1688609799|, ~weak$$choice2~0=~weak$$choice2~0_In1688609799, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1688609799} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1688609799, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1688609799, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1688609799|, ~y$w_buff0~0=~y$w_buff0~0_In1688609799, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1688609799, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out1688609799|, ~weak$$choice2~0=~weak$$choice2~0_In1688609799, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1688609799} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-11-28 18:13:04,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L762-->L763: Formula: (and (not (= (mod v_~weak$$choice2~0_22 256) 0)) (= v_~y$r_buff0_thd2~0_85 v_~y$r_buff0_thd2~0_84)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_14|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_10|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_84, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_22} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:13:04,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In677546982 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite23_In677546982| |P1Thread1of1ForFork1_#t~ite23_Out677546982|) (not .cse0) (= ~y$r_buff1_thd2~0_In677546982 |P1Thread1of1ForFork1_#t~ite24_Out677546982|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite24_Out677546982| |P1Thread1of1ForFork1_#t~ite23_Out677546982|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In677546982 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In677546982 256) 0)) (= (mod ~y$w_buff0_used~0_In677546982 256) 0) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In677546982 256) 0)))) (= ~y$r_buff1_thd2~0_In677546982 |P1Thread1of1ForFork1_#t~ite23_Out677546982|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In677546982, ~y$w_buff0_used~0=~y$w_buff0_used~0_In677546982, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In677546982, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In677546982|, ~weak$$choice2~0=~weak$$choice2~0_In677546982, ~y$w_buff1_used~0=~y$w_buff1_used~0_In677546982} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In677546982, ~y$w_buff0_used~0=~y$w_buff0_used~0_In677546982, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In677546982, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out677546982|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out677546982|, ~weak$$choice2~0=~weak$$choice2~0_In677546982, ~y$w_buff1_used~0=~y$w_buff1_used~0_In677546982} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-11-28 18:13:04,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [615] [615] L765-->L773: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256))) (= v_~y~0_14 v_~y$mem_tmp~0_4)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~y~0=v_~y~0_14, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-11-28 18:13:04,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In2142462432 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2142462432 256)))) (or (and (= ~y$w_buff0_used~0_In2142462432 |P2Thread1of1ForFork2_#t~ite28_Out2142462432|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite28_Out2142462432|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2142462432, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2142462432} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2142462432, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2142462432, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out2142462432|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-11-28 18:13:04,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L801-->L801-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In1888349068 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd3~0_In1888349068 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1888349068 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1888349068 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite29_Out1888349068|)) (and (= ~y$w_buff1_used~0_In1888349068 |P2Thread1of1ForFork2_#t~ite29_Out1888349068|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1888349068, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1888349068, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1888349068, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1888349068} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1888349068, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1888349068, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1888349068, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1888349068|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1888349068} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-11-28 18:13:04,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L802-->L803: Formula: (let ((.cse1 (= ~y$r_buff0_thd3~0_Out1818007480 ~y$r_buff0_thd3~0_In1818007480)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1818007480 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In1818007480 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= ~y$r_buff0_thd3~0_Out1818007480 0) (not .cse0) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1818007480, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1818007480} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1818007480, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out1818007480|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1818007480} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-11-28 18:13:04,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-2042685201 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-2042685201 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2042685201 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In-2042685201 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite31_Out-2042685201|)) (and (= ~y$r_buff1_thd3~0_In-2042685201 |P2Thread1of1ForFork2_#t~ite31_Out-2042685201|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2042685201, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2042685201, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2042685201, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2042685201} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2042685201, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2042685201, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-2042685201|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2042685201, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2042685201} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-11-28 18:13:04,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L803-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_26| v_~y$r_buff1_thd3~0_47)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_47, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_25|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-11-28 18:13:04,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [610] [610] L826-1-->L832: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:13:04,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L832-2-->L832-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-759420746 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-759420746 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite35_Out-759420746| ~y$w_buff1~0_In-759420746) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite35_Out-759420746| ~y~0_In-759420746)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-759420746, ~y~0=~y~0_In-759420746, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-759420746, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-759420746} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-759420746, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-759420746|, ~y~0=~y~0_In-759420746, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-759420746, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-759420746} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-11-28 18:13:04,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L832-4-->L833: Formula: (= v_~y~0_55 |v_ULTIMATE.start_main_#t~ite35_32|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_32|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ~y~0=v_~y~0_55} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-11-28 18:13:04,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In372821735 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In372821735 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite37_Out372821735| 0)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In372821735 |ULTIMATE.start_main_#t~ite37_Out372821735|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In372821735, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In372821735} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In372821735, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In372821735, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out372821735|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:13:04,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-1749278209 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1749278209 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1749278209 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1749278209 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-1749278209| ~y$w_buff1_used~0_In-1749278209) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite38_Out-1749278209|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1749278209, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1749278209, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1749278209, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1749278209} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1749278209, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1749278209, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1749278209|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1749278209, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1749278209} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:13:04,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L835-->L835-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In112809775 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In112809775 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In112809775 |ULTIMATE.start_main_#t~ite39_Out112809775|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite39_Out112809775|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In112809775, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In112809775} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In112809775, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out112809775|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In112809775} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:13:04,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L836-->L836-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In99804355 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In99804355 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In99804355 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In99804355 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite40_Out99804355|)) (and (= ~y$r_buff1_thd0~0_In99804355 |ULTIMATE.start_main_#t~ite40_Out99804355|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In99804355, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In99804355, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In99804355, ~y$w_buff1_used~0=~y$w_buff1_used~0_In99804355} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out99804355|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In99804355, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In99804355, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In99804355, ~y$w_buff1_used~0=~y$w_buff1_used~0_In99804355} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:13:04,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|) (= v_~y$r_buff1_thd0~0_131 |v_ULTIMATE.start_main_#t~ite40_46|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_84 0) (= 1 v_~__unbuffered_p2_EAX~0_84) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~__unbuffered_p0_EAX~0_34))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_84, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_84} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_84, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_84, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_131, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:13:04,358 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:13:04,358 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:13:04,359 INFO L168 Benchmark]: Toolchain (without parser) took 18934.08 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 980.4 MB). Free memory was 960.4 MB in the beginning and 826.5 MB in the end (delta: 133.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-11-28 18:13:04,360 INFO L168 Benchmark]: CDTParser took 0.98 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:13:04,360 INFO L168 Benchmark]: CACSL2BoogieTranslator took 733.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -138.6 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:13:04,361 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.09 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:13:04,361 INFO L168 Benchmark]: Boogie Preprocessor took 37.11 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:13:04,362 INFO L168 Benchmark]: RCFGBuilder took 753.19 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: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:13:04,362 INFO L168 Benchmark]: TraceAbstraction took 17233.33 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 855.1 MB). Free memory was 1.0 GB in the beginning and 846.8 MB in the end (delta: 192.2 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-11-28 18:13:04,363 INFO L168 Benchmark]: Witness Printer took 100.36 ms. Allocated memory is still 2.0 GB. Free memory was 846.8 MB in the beginning and 826.5 MB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:13:04,366 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.98 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 733.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -138.6 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.09 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.11 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 753.19 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: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17233.33 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 855.1 MB). Free memory was 1.0 GB in the beginning and 846.8 MB in the end (delta: 192.2 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 100.36 ms. Allocated memory is still 2.0 GB. Free memory was 846.8 MB in the beginning and 826.5 MB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 154 ProgramPointsBefore, 71 ProgramPointsAfterwards, 179 TransitionsBefore, 79 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 21 ChoiceCompositions, 4868 VarBasedMoverChecksPositive, 199 VarBasedMoverChecksNegative, 61 SemBasedMoverChecksPositive, 174 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 44280 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t934, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L824] FCALL, FORK 0 pthread_create(&t935, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L826] FCALL, FORK 0 pthread_create(&t936, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 1 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L750] 2 x = 1 [L753] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)=1, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L760] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L832] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L835] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 145 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.8s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1492 SDtfs, 1365 SDslu, 1820 SDs, 0 SdLazy, 741 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18470occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 13624 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 384 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 324 ConstructedInterpolants, 0 QuantifiedInterpolants, 35700 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...