./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix052_pso.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/mix052_pso.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 d320affbb4ad9233eaa9e0f09929715ad0605f8c ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:18:32,922 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:18:32,925 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:18:32,939 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:18:32,939 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:18:32,941 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:18:32,942 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:18:32,945 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:18:32,947 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:18:32,948 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:18:32,949 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:18:32,951 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:18:32,951 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:18:32,952 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:18:32,954 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:18:32,955 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:18:32,956 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:18:32,958 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:18:32,961 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:18:32,963 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:18:32,965 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:18:32,966 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:18:32,968 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:18:32,969 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:18:32,973 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:18:32,974 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:18:32,974 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:18:32,977 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:18:32,977 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:18:32,979 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:18:32,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:18:32,981 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:18:32,982 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:18:32,983 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:18:32,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:18:32,988 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:18:32,989 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:18:32,990 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:18:32,990 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:18:32,994 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:18:32,996 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:18:32,998 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:18:33,022 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:18:33,023 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:18:33,024 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:18:33,025 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:18:33,025 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:18:33,026 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:18:33,026 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:18:33,026 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:18:33,026 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:18:33,027 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:18:33,028 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:18:33,028 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:18:33,028 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:18:33,029 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:18:33,029 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:18:33,030 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:18:33,030 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:18:33,030 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:18:33,031 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:18:33,031 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:18:33,031 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:18:33,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:18:33,032 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:18:33,032 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:18:33,033 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:18:33,033 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:18:33,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:18:33,033 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:18:33,034 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:18:33,034 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 -> d320affbb4ad9233eaa9e0f09929715ad0605f8c [2019-11-28 18:18:33,380 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:18:33,394 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:18:33,398 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:18:33,400 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:18:33,400 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:18:33,401 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix052_pso.opt.i [2019-11-28 18:18:33,465 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89ad58b00/aaf11dd1ac1c4fc8a4f41199be8bee56/FLAG2d3cb527a [2019-11-28 18:18:34,036 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:18:34,036 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix052_pso.opt.i [2019-11-28 18:18:34,053 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89ad58b00/aaf11dd1ac1c4fc8a4f41199be8bee56/FLAG2d3cb527a [2019-11-28 18:18:34,362 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89ad58b00/aaf11dd1ac1c4fc8a4f41199be8bee56 [2019-11-28 18:18:34,365 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:18:34,367 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:18:34,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:18:34,368 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:18:34,372 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:18:34,374 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:18:34" (1/1) ... [2019-11-28 18:18:34,377 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d265c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:18:34, skipping insertion in model container [2019-11-28 18:18:34,378 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:18:34" (1/1) ... [2019-11-28 18:18:34,386 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:18:34,452 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:18:35,004 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:18:35,023 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:18:35,126 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:18:35,205 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:18:35,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:18:35 WrapperNode [2019-11-28 18:18:35,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:18:35,207 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:18:35,207 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:18:35,207 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:18:35,217 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:18:35" (1/1) ... [2019-11-28 18:18:35,238 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:18:35" (1/1) ... [2019-11-28 18:18:35,279 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:18:35,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:18:35,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:18:35,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:18:35,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:18:35" (1/1) ... [2019-11-28 18:18:35,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:18:35" (1/1) ... [2019-11-28 18:18:35,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:18:35" (1/1) ... [2019-11-28 18:18:35,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:18:35" (1/1) ... [2019-11-28 18:18:35,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:18:35" (1/1) ... [2019-11-28 18:18:35,317 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:18:35" (1/1) ... [2019-11-28 18:18:35,324 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:18:35" (1/1) ... [2019-11-28 18:18:35,330 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:18:35,331 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:18:35,331 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:18:35,331 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:18:35,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:18:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:18:35,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:18:35,422 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:18:35,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:18:35,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:18:35,422 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:18:35,423 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:18:35,423 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:18:35,423 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:18:35,423 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-11-28 18:18:35,424 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-11-28 18:18:35,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:18:35,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:18:35,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:18:35,426 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:18:36,143 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:18:36,143 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:18:36,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:18:36 BoogieIcfgContainer [2019-11-28 18:18:36,146 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:18:36,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:18:36,147 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:18:36,152 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:18:36,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:18:34" (1/3) ... [2019-11-28 18:18:36,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29dfff29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:18:36, skipping insertion in model container [2019-11-28 18:18:36,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:18:35" (2/3) ... [2019-11-28 18:18:36,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29dfff29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:18:36, skipping insertion in model container [2019-11-28 18:18:36,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:18:36" (3/3) ... [2019-11-28 18:18:36,159 INFO L109 eAbstractionObserver]: Analyzing ICFG mix052_pso.opt.i [2019-11-28 18:18:36,170 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:18:36,171 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:18:36,182 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:18:36,184 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:18:36,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,248 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,249 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,253 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,253 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,299 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,299 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,299 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,304 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,305 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:18:36,339 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-28 18:18:36,365 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:18:36,365 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:18:36,365 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:18:36,365 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:18:36,366 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:18:36,366 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:18:36,366 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:18:36,366 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:18:36,389 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 176 transitions [2019-11-28 18:18:36,392 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-11-28 18:18:36,525 INFO L134 PetriNetUnfolder]: 35/173 cut-off events. [2019-11-28 18:18:36,525 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:18:36,548 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 561 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-11-28 18:18:36,573 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-11-28 18:18:36,642 INFO L134 PetriNetUnfolder]: 35/173 cut-off events. [2019-11-28 18:18:36,643 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:18:36,651 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 561 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-11-28 18:18:36,669 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-11-28 18:18:36,670 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:18:41,387 WARN L192 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-11-28 18:18:41,541 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-28 18:18:41,614 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39870 [2019-11-28 18:18:41,614 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-11-28 18:18:41,620 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 72 places, 80 transitions [2019-11-28 18:18:42,597 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 12726 states. [2019-11-28 18:18:42,599 INFO L276 IsEmpty]: Start isEmpty. Operand 12726 states. [2019-11-28 18:18:42,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 18:18:42,605 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:18:42,606 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:18:42,607 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:18:42,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:18:42,614 INFO L82 PathProgramCache]: Analyzing trace with hash -534032227, now seen corresponding path program 1 times [2019-11-28 18:18:42,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:18:42,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637972258] [2019-11-28 18:18:42,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:18:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:18:42,899 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:18:42,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637972258] [2019-11-28 18:18:42,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:18:42,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:18:42,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80384168] [2019-11-28 18:18:42,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:18:42,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:18:42,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:18:42,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:18:42,929 INFO L87 Difference]: Start difference. First operand 12726 states. Second operand 3 states. [2019-11-28 18:18:43,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:18:43,291 INFO L93 Difference]: Finished difference Result 12374 states and 47232 transitions. [2019-11-28 18:18:43,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:18:43,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-28 18:18:43,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:18:43,433 INFO L225 Difference]: With dead ends: 12374 [2019-11-28 18:18:43,434 INFO L226 Difference]: Without dead ends: 11654 [2019-11-28 18:18:43,435 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:18:43,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11654 states. [2019-11-28 18:18:44,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11654 to 11654. [2019-11-28 18:18:44,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11654 states. [2019-11-28 18:18:44,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11654 states to 11654 states and 44412 transitions. [2019-11-28 18:18:44,327 INFO L78 Accepts]: Start accepts. Automaton has 11654 states and 44412 transitions. Word has length 7 [2019-11-28 18:18:44,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:18:44,328 INFO L462 AbstractCegarLoop]: Abstraction has 11654 states and 44412 transitions. [2019-11-28 18:18:44,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:18:44,329 INFO L276 IsEmpty]: Start isEmpty. Operand 11654 states and 44412 transitions. [2019-11-28 18:18:44,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 18:18:44,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:18:44,341 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:18:44,341 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:18:44,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:18:44,342 INFO L82 PathProgramCache]: Analyzing trace with hash 633204052, now seen corresponding path program 1 times [2019-11-28 18:18:44,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:18:44,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757553159] [2019-11-28 18:18:44,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:18:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:18:44,476 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:18:44,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757553159] [2019-11-28 18:18:44,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:18:44,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:18:44,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885405159] [2019-11-28 18:18:44,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:18:44,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:18:44,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:18:44,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:18:44,482 INFO L87 Difference]: Start difference. First operand 11654 states and 44412 transitions. Second operand 3 states. [2019-11-28 18:18:44,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:18:44,606 INFO L93 Difference]: Finished difference Result 7008 states and 23356 transitions. [2019-11-28 18:18:44,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:18:44,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-28 18:18:44,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:18:44,651 INFO L225 Difference]: With dead ends: 7008 [2019-11-28 18:18:44,652 INFO L226 Difference]: Without dead ends: 7008 [2019-11-28 18:18:44,653 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:18:44,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7008 states. [2019-11-28 18:18:44,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7008 to 7008. [2019-11-28 18:18:44,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7008 states. [2019-11-28 18:18:44,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7008 states to 7008 states and 23356 transitions. [2019-11-28 18:18:44,928 INFO L78 Accepts]: Start accepts. Automaton has 7008 states and 23356 transitions. Word has length 13 [2019-11-28 18:18:44,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:18:44,928 INFO L462 AbstractCegarLoop]: Abstraction has 7008 states and 23356 transitions. [2019-11-28 18:18:44,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:18:44,929 INFO L276 IsEmpty]: Start isEmpty. Operand 7008 states and 23356 transitions. [2019-11-28 18:18:44,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:18:44,930 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:18:44,931 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:18:44,931 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:18:44,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:18:44,932 INFO L82 PathProgramCache]: Analyzing trace with hash -691058683, now seen corresponding path program 1 times [2019-11-28 18:18:44,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:18:44,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540623940] [2019-11-28 18:18:44,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:18:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:18:45,048 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:18:45,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540623940] [2019-11-28 18:18:45,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:18:45,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:18:45,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430596281] [2019-11-28 18:18:45,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:18:45,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:18:45,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:18:45,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:18:45,053 INFO L87 Difference]: Start difference. First operand 7008 states and 23356 transitions. Second operand 4 states. [2019-11-28 18:18:45,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:18:45,103 INFO L93 Difference]: Finished difference Result 1656 states and 4436 transitions. [2019-11-28 18:18:45,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:18:45,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:18:45,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:18:45,110 INFO L225 Difference]: With dead ends: 1656 [2019-11-28 18:18:45,111 INFO L226 Difference]: Without dead ends: 1656 [2019-11-28 18:18:45,111 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:18:45,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2019-11-28 18:18:45,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1656. [2019-11-28 18:18:45,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1656 states. [2019-11-28 18:18:45,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 4436 transitions. [2019-11-28 18:18:45,155 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 4436 transitions. Word has length 14 [2019-11-28 18:18:45,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:18:45,156 INFO L462 AbstractCegarLoop]: Abstraction has 1656 states and 4436 transitions. [2019-11-28 18:18:45,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:18:45,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 4436 transitions. [2019-11-28 18:18:45,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:18:45,158 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:18:45,158 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:18:45,158 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:18:45,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:18:45,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1912379884, now seen corresponding path program 1 times [2019-11-28 18:18:45,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:18:45,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496693096] [2019-11-28 18:18:45,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:18:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:18:45,295 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:18:45,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496693096] [2019-11-28 18:18:45,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:18:45,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:18:45,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363543588] [2019-11-28 18:18:45,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:18:45,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:18:45,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:18:45,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:18:45,298 INFO L87 Difference]: Start difference. First operand 1656 states and 4436 transitions. Second operand 4 states. [2019-11-28 18:18:45,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:18:45,511 INFO L93 Difference]: Finished difference Result 2339 states and 6191 transitions. [2019-11-28 18:18:45,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:18:45,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-28 18:18:45,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:18:45,519 INFO L225 Difference]: With dead ends: 2339 [2019-11-28 18:18:45,520 INFO L226 Difference]: Without dead ends: 2339 [2019-11-28 18:18:45,520 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:18:45,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2339 states. [2019-11-28 18:18:45,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2339 to 2187. [2019-11-28 18:18:45,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2187 states. [2019-11-28 18:18:45,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2187 states to 2187 states and 5853 transitions. [2019-11-28 18:18:45,586 INFO L78 Accepts]: Start accepts. Automaton has 2187 states and 5853 transitions. Word has length 16 [2019-11-28 18:18:45,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:18:45,586 INFO L462 AbstractCegarLoop]: Abstraction has 2187 states and 5853 transitions. [2019-11-28 18:18:45,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:18:45,587 INFO L276 IsEmpty]: Start isEmpty. Operand 2187 states and 5853 transitions. [2019-11-28 18:18:45,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:18:45,588 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:18:45,588 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:18:45,589 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:18:45,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:18:45,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1912467552, now seen corresponding path program 1 times [2019-11-28 18:18:45,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:18:45,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900925428] [2019-11-28 18:18:45,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:18:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:18:45,685 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:18:45,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900925428] [2019-11-28 18:18:45,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:18:45,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:18:45,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302307378] [2019-11-28 18:18:45,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:18:45,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:18:45,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:18:45,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:18:45,688 INFO L87 Difference]: Start difference. First operand 2187 states and 5853 transitions. Second operand 4 states. [2019-11-28 18:18:45,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:18:45,850 INFO L93 Difference]: Finished difference Result 2734 states and 7220 transitions. [2019-11-28 18:18:45,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:18:45,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-28 18:18:45,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:18:45,858 INFO L225 Difference]: With dead ends: 2734 [2019-11-28 18:18:45,858 INFO L226 Difference]: Without dead ends: 2734 [2019-11-28 18:18:45,859 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:18:45,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2734 states. [2019-11-28 18:18:45,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2734 to 2088. [2019-11-28 18:18:45,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2088 states. [2019-11-28 18:18:45,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 5552 transitions. [2019-11-28 18:18:45,917 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 5552 transitions. Word has length 16 [2019-11-28 18:18:45,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:18:45,917 INFO L462 AbstractCegarLoop]: Abstraction has 2088 states and 5552 transitions. [2019-11-28 18:18:45,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:18:45,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 5552 transitions. [2019-11-28 18:18:45,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 18:18:45,921 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:18:45,922 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:18:45,922 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:18:45,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:18:45,922 INFO L82 PathProgramCache]: Analyzing trace with hash 941915908, now seen corresponding path program 1 times [2019-11-28 18:18:45,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:18:45,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194625903] [2019-11-28 18:18:45,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:18:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:18:46,012 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:18:46,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194625903] [2019-11-28 18:18:46,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:18:46,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:18:46,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789184610] [2019-11-28 18:18:46,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:18:46,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:18:46,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:18:46,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:18:46,015 INFO L87 Difference]: Start difference. First operand 2088 states and 5552 transitions. Second operand 5 states. [2019-11-28 18:18:46,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:18:46,470 INFO L93 Difference]: Finished difference Result 3138 states and 8203 transitions. [2019-11-28 18:18:46,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:18:46,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-28 18:18:46,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:18:46,480 INFO L225 Difference]: With dead ends: 3138 [2019-11-28 18:18:46,480 INFO L226 Difference]: Without dead ends: 3138 [2019-11-28 18:18:46,480 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:18:46,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2019-11-28 18:18:46,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 2628. [2019-11-28 18:18:46,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2628 states. [2019-11-28 18:18:46,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2628 states to 2628 states and 6941 transitions. [2019-11-28 18:18:46,553 INFO L78 Accepts]: Start accepts. Automaton has 2628 states and 6941 transitions. Word has length 29 [2019-11-28 18:18:46,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:18:46,553 INFO L462 AbstractCegarLoop]: Abstraction has 2628 states and 6941 transitions. [2019-11-28 18:18:46,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:18:46,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2628 states and 6941 transitions. [2019-11-28 18:18:46,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 18:18:46,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:18:46,559 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:18:46,560 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:18:46,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:18:46,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1752215634, now seen corresponding path program 1 times [2019-11-28 18:18:46,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:18:46,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214221794] [2019-11-28 18:18:46,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:18:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:18:46,607 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:18:46,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214221794] [2019-11-28 18:18:46,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:18:46,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:18:46,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239719633] [2019-11-28 18:18:46,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:18:46,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:18:46,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:18:46,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:18:46,609 INFO L87 Difference]: Start difference. First operand 2628 states and 6941 transitions. Second operand 3 states. [2019-11-28 18:18:46,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:18:46,662 INFO L93 Difference]: Finished difference Result 3598 states and 9380 transitions. [2019-11-28 18:18:46,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:18:46,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-28 18:18:46,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:18:46,670 INFO L225 Difference]: With dead ends: 3598 [2019-11-28 18:18:46,670 INFO L226 Difference]: Without dead ends: 3598 [2019-11-28 18:18:46,671 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:18:46,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3598 states. [2019-11-28 18:18:46,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3598 to 2832. [2019-11-28 18:18:46,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2832 states. [2019-11-28 18:18:46,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2832 states to 2832 states and 7444 transitions. [2019-11-28 18:18:46,742 INFO L78 Accepts]: Start accepts. Automaton has 2832 states and 7444 transitions. Word has length 29 [2019-11-28 18:18:46,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:18:46,742 INFO L462 AbstractCegarLoop]: Abstraction has 2832 states and 7444 transitions. [2019-11-28 18:18:46,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:18:46,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2832 states and 7444 transitions. [2019-11-28 18:18:46,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 18:18:46,751 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:18:46,751 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:18:46,752 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:18:46,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:18:46,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1147773388, now seen corresponding path program 1 times [2019-11-28 18:18:46,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:18:46,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469543038] [2019-11-28 18:18:46,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:18:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:18:46,840 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:18:46,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469543038] [2019-11-28 18:18:46,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:18:46,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:18:46,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668030338] [2019-11-28 18:18:46,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:18:46,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:18:46,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:18:46,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:18:46,842 INFO L87 Difference]: Start difference. First operand 2832 states and 7444 transitions. Second operand 5 states. [2019-11-28 18:18:46,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:18:46,884 INFO L93 Difference]: Finished difference Result 1864 states and 4973 transitions. [2019-11-28 18:18:46,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:18:46,885 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-28 18:18:46,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:18:46,889 INFO L225 Difference]: With dead ends: 1864 [2019-11-28 18:18:46,889 INFO L226 Difference]: Without dead ends: 1864 [2019-11-28 18:18:46,889 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:18:46,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2019-11-28 18:18:46,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1704. [2019-11-28 18:18:46,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2019-11-28 18:18:47,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 4583 transitions. [2019-11-28 18:18:47,057 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 4583 transitions. Word has length 29 [2019-11-28 18:18:47,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:18:47,058 INFO L462 AbstractCegarLoop]: Abstraction has 1704 states and 4583 transitions. [2019-11-28 18:18:47,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:18:47,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 4583 transitions. [2019-11-28 18:18:47,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 18:18:47,063 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:18:47,063 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:18:47,064 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:18:47,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:18:47,064 INFO L82 PathProgramCache]: Analyzing trace with hash 211715067, now seen corresponding path program 1 times [2019-11-28 18:18:47,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:18:47,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118996193] [2019-11-28 18:18:47,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:18:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:18:47,160 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:18:47,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118996193] [2019-11-28 18:18:47,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:18:47,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:18:47,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108185304] [2019-11-28 18:18:47,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:18:47,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:18:47,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:18:47,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:18:47,162 INFO L87 Difference]: Start difference. First operand 1704 states and 4583 transitions. Second operand 6 states. [2019-11-28 18:18:47,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:18:47,646 INFO L93 Difference]: Finished difference Result 2286 states and 6018 transitions. [2019-11-28 18:18:47,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:18:47,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-11-28 18:18:47,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:18:47,656 INFO L225 Difference]: With dead ends: 2286 [2019-11-28 18:18:47,656 INFO L226 Difference]: Without dead ends: 2286 [2019-11-28 18:18:47,657 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:18:47,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2286 states. [2019-11-28 18:18:47,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2286 to 1754. [2019-11-28 18:18:47,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1754 states. [2019-11-28 18:18:47,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 4708 transitions. [2019-11-28 18:18:47,698 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 4708 transitions. Word has length 44 [2019-11-28 18:18:47,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:18:47,698 INFO L462 AbstractCegarLoop]: Abstraction has 1754 states and 4708 transitions. [2019-11-28 18:18:47,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:18:47,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 4708 transitions. [2019-11-28 18:18:47,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 18:18:47,704 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:18:47,704 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] [2019-11-28 18:18:47,704 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:18:47,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:18:47,705 INFO L82 PathProgramCache]: Analyzing trace with hash -796423154, now seen corresponding path program 1 times [2019-11-28 18:18:47,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:18:47,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136288248] [2019-11-28 18:18:47,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:18:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:18:47,752 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:18:47,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136288248] [2019-11-28 18:18:47,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:18:47,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:18:47,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559645629] [2019-11-28 18:18:47,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:18:47,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:18:47,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:18:47,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:18:47,754 INFO L87 Difference]: Start difference. First operand 1754 states and 4708 transitions. Second operand 3 states. [2019-11-28 18:18:47,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:18:47,807 INFO L93 Difference]: Finished difference Result 2084 states and 5369 transitions. [2019-11-28 18:18:47,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:18:47,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-28 18:18:47,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:18:47,811 INFO L225 Difference]: With dead ends: 2084 [2019-11-28 18:18:47,811 INFO L226 Difference]: Without dead ends: 2084 [2019-11-28 18:18:47,811 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:18:47,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2084 states. [2019-11-28 18:18:47,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2084 to 1864. [2019-11-28 18:18:47,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1864 states. [2019-11-28 18:18:47,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 4851 transitions. [2019-11-28 18:18:47,846 INFO L78 Accepts]: Start accepts. Automaton has 1864 states and 4851 transitions. Word has length 44 [2019-11-28 18:18:47,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:18:47,847 INFO L462 AbstractCegarLoop]: Abstraction has 1864 states and 4851 transitions. [2019-11-28 18:18:47,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:18:47,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 4851 transitions. [2019-11-28 18:18:47,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 18:18:47,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:18:47,852 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] [2019-11-28 18:18:47,853 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:18:47,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:18:47,853 INFO L82 PathProgramCache]: Analyzing trace with hash -753069185, now seen corresponding path program 2 times [2019-11-28 18:18:47,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:18:47,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765548852] [2019-11-28 18:18:47,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:18:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:18:47,954 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:18:47,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765548852] [2019-11-28 18:18:47,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:18:47,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:18:47,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108755806] [2019-11-28 18:18:47,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:18:47,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:18:47,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:18:47,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:18:47,956 INFO L87 Difference]: Start difference. First operand 1864 states and 4851 transitions. Second operand 3 states. [2019-11-28 18:18:47,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:18:47,976 INFO L93 Difference]: Finished difference Result 1862 states and 4846 transitions. [2019-11-28 18:18:47,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:18:47,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-28 18:18:47,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:18:47,980 INFO L225 Difference]: With dead ends: 1862 [2019-11-28 18:18:47,980 INFO L226 Difference]: Without dead ends: 1862 [2019-11-28 18:18:47,981 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:18:47,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2019-11-28 18:18:48,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1596. [2019-11-28 18:18:48,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1596 states. [2019-11-28 18:18:48,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 4205 transitions. [2019-11-28 18:18:48,012 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 4205 transitions. Word has length 44 [2019-11-28 18:18:48,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:18:48,012 INFO L462 AbstractCegarLoop]: Abstraction has 1596 states and 4205 transitions. [2019-11-28 18:18:48,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:18:48,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 4205 transitions. [2019-11-28 18:18:48,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:18:48,016 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:18:48,016 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:18:48,017 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:18:48,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:18:48,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1981719095, now seen corresponding path program 1 times [2019-11-28 18:18:48,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:18:48,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949571300] [2019-11-28 18:18:48,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:18:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:18:48,091 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:18:48,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949571300] [2019-11-28 18:18:48,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:18:48,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:18:48,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355215378] [2019-11-28 18:18:48,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:18:48,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:18:48,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:18:48,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:18:48,093 INFO L87 Difference]: Start difference. First operand 1596 states and 4205 transitions. Second operand 3 states. [2019-11-28 18:18:48,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:18:48,119 INFO L93 Difference]: Finished difference Result 2397 states and 5919 transitions. [2019-11-28 18:18:48,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:18:48,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-11-28 18:18:48,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:18:48,125 INFO L225 Difference]: With dead ends: 2397 [2019-11-28 18:18:48,126 INFO L226 Difference]: Without dead ends: 2279 [2019-11-28 18:18:48,126 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:18:48,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2019-11-28 18:18:48,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 1548. [2019-11-28 18:18:48,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1548 states. [2019-11-28 18:18:48,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 4018 transitions. [2019-11-28 18:18:48,159 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 4018 transitions. Word has length 45 [2019-11-28 18:18:48,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:18:48,159 INFO L462 AbstractCegarLoop]: Abstraction has 1548 states and 4018 transitions. [2019-11-28 18:18:48,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:18:48,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 4018 transitions. [2019-11-28 18:18:48,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:18:48,163 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:18:48,163 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:18:48,164 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:18:48,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:18:48,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1886282581, now seen corresponding path program 2 times [2019-11-28 18:18:48,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:18:48,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51157301] [2019-11-28 18:18:48,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:18:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:18:48,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:18:48,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51157301] [2019-11-28 18:18:48,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:18:48,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:18:48,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064218726] [2019-11-28 18:18:48,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:18:48,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:18:48,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:18:48,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:18:48,223 INFO L87 Difference]: Start difference. First operand 1548 states and 4018 transitions. Second operand 3 states. [2019-11-28 18:18:48,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:18:48,240 INFO L93 Difference]: Finished difference Result 2329 states and 5693 transitions. [2019-11-28 18:18:48,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:18:48,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-11-28 18:18:48,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:18:48,243 INFO L225 Difference]: With dead ends: 2329 [2019-11-28 18:18:48,243 INFO L226 Difference]: Without dead ends: 837 [2019-11-28 18:18:48,244 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:18:48,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2019-11-28 18:18:48,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2019-11-28 18:18:48,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-11-28 18:18:48,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1780 transitions. [2019-11-28 18:18:48,258 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1780 transitions. Word has length 45 [2019-11-28 18:18:48,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:18:48,259 INFO L462 AbstractCegarLoop]: Abstraction has 837 states and 1780 transitions. [2019-11-28 18:18:48,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:18:48,259 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1780 transitions. [2019-11-28 18:18:48,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:18:48,261 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:18:48,261 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:18:48,261 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:18:48,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:18:48,262 INFO L82 PathProgramCache]: Analyzing trace with hash 965332247, now seen corresponding path program 3 times [2019-11-28 18:18:48,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:18:48,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403701212] [2019-11-28 18:18:48,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:18:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:18:48,359 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:18:48,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403701212] [2019-11-28 18:18:48,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:18:48,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:18:48,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374228041] [2019-11-28 18:18:48,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:18:48,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:18:48,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:18:48,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:18:48,362 INFO L87 Difference]: Start difference. First operand 837 states and 1780 transitions. Second operand 7 states. [2019-11-28 18:18:48,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:18:48,659 INFO L93 Difference]: Finished difference Result 1986 states and 4113 transitions. [2019-11-28 18:18:48,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 18:18:48,660 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-11-28 18:18:48,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:18:48,664 INFO L225 Difference]: With dead ends: 1986 [2019-11-28 18:18:48,664 INFO L226 Difference]: Without dead ends: 1333 [2019-11-28 18:18:48,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-11-28 18:18:48,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2019-11-28 18:18:48,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 885. [2019-11-28 18:18:48,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2019-11-28 18:18:48,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1881 transitions. [2019-11-28 18:18:48,683 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1881 transitions. Word has length 45 [2019-11-28 18:18:48,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:18:48,683 INFO L462 AbstractCegarLoop]: Abstraction has 885 states and 1881 transitions. [2019-11-28 18:18:48,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:18:48,683 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1881 transitions. [2019-11-28 18:18:48,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:18:48,685 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:18:48,686 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:18:48,686 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:18:48,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:18:48,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1361037591, now seen corresponding path program 4 times [2019-11-28 18:18:48,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:18:48,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336654814] [2019-11-28 18:18:48,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:18:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:18:48,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:18:48,815 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:18:48,815 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:18:48,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y$w_buff1_used~0_392 0) (= v_~x~0_45 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1394~0.base_31| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1394~0.base_31|) |v_ULTIMATE.start_main_~#t1394~0.offset_23| 0)) |v_#memory_int_17|) (= v_~y$mem_tmp~0_16 0) (= 0 v_~y$r_buff1_thd1~0_88) (= (store .cse0 |v_ULTIMATE.start_main_~#t1394~0.base_31| 1) |v_#valid_62|) (= |v_ULTIMATE.start_main_~#t1394~0.offset_23| 0) (= v_~weak$$choice2~0_148 0) (= v_~y$r_buff0_thd1~0_34 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1394~0.base_31|)) (= v_~y$w_buff0_used~0_595 0) (= v_~y$r_buff1_thd0~0_147 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1394~0.base_31|) (= 0 v_~y$flush_delayed~0_39) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~y$r_buff0_thd3~0_173) (= v_~y$r_buff0_thd0~0_94 0) (= 0 v_~__unbuffered_p2_EAX~0_109) (= 0 v_~y$r_buff0_thd2~0_289) (= v_~y$w_buff1~0_216 0) (= v_~z~0_45 0) (= 0 v_~y$w_buff0~0_304) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p1_EAX~0_57) (= v_~y~0_127 0) (= v_~main$tmp_guard0~0_20 0) (= v_~y$read_delayed~0_5 0) (= v_~main$tmp_guard1~0_32 0) (= |v_#NULL.offset_4| 0) (= 0 v_~y$r_buff1_thd2~0_268) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd3~0_150) (= 0 v_~__unbuffered_cnt~0_97) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1394~0.base_31| 4)) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_19|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t1396~0.base=|v_ULTIMATE.start_main_~#t1396~0.base_23|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$mem_tmp~0=v_~y$mem_tmp~0_16, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_150, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_57, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_34, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_109, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_~#t1394~0.base=|v_ULTIMATE.start_main_~#t1394~0.base_31|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_35|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_33|, ULTIMATE.start_main_~#t1395~0.offset=|v_ULTIMATE.start_main_~#t1395~0.offset_22|, ~weak$$choice0~0=v_~weak$$choice0~0_12, ULTIMATE.start_main_~#t1394~0.offset=|v_ULTIMATE.start_main_~#t1394~0.offset_23|, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_65|, ~y$w_buff1~0=v_~y$w_buff1~0_216, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_289, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_147, ~x~0=v_~x~0_45, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_595, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_~#t1395~0.base=|v_ULTIMATE.start_main_~#t1395~0.base_29|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_88, ~y$w_buff0~0=v_~y$w_buff0~0_304, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_173, ULTIMATE.start_main_~#t1396~0.offset=|v_ULTIMATE.start_main_~#t1396~0.offset_15|, ~y~0=v_~y~0_127, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_29|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_33|, ~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_268, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_94, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_45, ~weak$$choice2~0=v_~weak$$choice2~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1395~0.base, ULTIMATE.start_main_~#t1396~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1396~0.offset, ~y~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1394~0.base, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1395~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1394~0.offset, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:18:48,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L810-1-->L812: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1395~0.base_9| 0)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1395~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1395~0.base_9|) |v_ULTIMATE.start_main_~#t1395~0.offset_9| 1)) |v_#memory_int_9|) (= |v_ULTIMATE.start_main_~#t1395~0.offset_9| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1395~0.base_9|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1395~0.base_9| 4)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1395~0.base_9|)) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1395~0.base_9| 1) |v_#valid_31|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1395~0.offset=|v_ULTIMATE.start_main_~#t1395~0.offset_9|, ULTIMATE.start_main_~#t1395~0.base=|v_ULTIMATE.start_main_~#t1395~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1395~0.offset, ULTIMATE.start_main_~#t1395~0.base] because there is no mapped edge [2019-11-28 18:18:48,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L812-1-->L814: Formula: (and (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1396~0.base_10| 1)) (= |v_ULTIMATE.start_main_~#t1396~0.offset_9| 0) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1396~0.base_10|)) (not (= 0 |v_ULTIMATE.start_main_~#t1396~0.base_10|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1396~0.base_10|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1396~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1396~0.base_10|) |v_ULTIMATE.start_main_~#t1396~0.offset_9| 2)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1396~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1396~0.base=|v_ULTIMATE.start_main_~#t1396~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1396~0.offset=|v_ULTIMATE.start_main_~#t1396~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1396~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1396~0.offset] because there is no mapped edge [2019-11-28 18:18:48,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [610] [610] L4-->L787: Formula: (and (= v_~y$r_buff0_thd2~0_62 v_~y$r_buff1_thd2~0_26) (= v_~__unbuffered_p2_EAX~0_4 v_~z~0_4) (= v_~y$r_buff0_thd3~0_25 1) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18)) (= v_~y$r_buff1_thd1~0_3 v_~y$r_buff0_thd1~0_4) (= v_~y$r_buff0_thd0~0_15 v_~y$r_buff1_thd0~0_10) (= v_~y$r_buff0_thd3~0_26 v_~y$r_buff1_thd3~0_26)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18, ~z~0=v_~z~0_4} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_26, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_3, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_26, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_4, ~z~0=v_~z~0_4, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:18:48,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_10|) (= v_~z~0_32 1) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_10|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63) (= v_~x~0_16 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~z~0=v_~z~0_32, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, ~x~0=v_~x~0_16, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:18:48,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L752-->L752-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In423785213 256) 0))) (or (and (not .cse0) (= ~y$w_buff0~0_In423785213 |P1Thread1of1ForFork1_#t~ite9_Out423785213|) (= |P1Thread1of1ForFork1_#t~ite8_In423785213| |P1Thread1of1ForFork1_#t~ite8_Out423785213|)) (and (= |P1Thread1of1ForFork1_#t~ite8_Out423785213| ~y$w_buff0~0_In423785213) .cse0 (= |P1Thread1of1ForFork1_#t~ite8_Out423785213| |P1Thread1of1ForFork1_#t~ite9_Out423785213|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In423785213 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In423785213 256)) (and (= 0 (mod ~y$r_buff1_thd2~0_In423785213 256)) .cse1) (and (= (mod ~y$w_buff1_used~0_In423785213 256) 0) .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In423785213, ~y$w_buff0_used~0=~y$w_buff0_used~0_In423785213, ~y$w_buff0~0=~y$w_buff0~0_In423785213, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In423785213, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In423785213|, ~weak$$choice2~0=~weak$$choice2~0_In423785213, ~y$w_buff1_used~0=~y$w_buff1_used~0_In423785213} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In423785213, ~y$w_buff0_used~0=~y$w_buff0_used~0_In423785213, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out423785213|, ~y$w_buff0~0=~y$w_buff0~0_In423785213, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In423785213, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out423785213|, ~weak$$choice2~0=~weak$$choice2~0_In423785213, ~y$w_buff1_used~0=~y$w_buff1_used~0_In423785213} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-11-28 18:18:48,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L753-->L753-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1531213498 256)))) (or (and .cse0 (= ~y$w_buff1~0_In1531213498 |P1Thread1of1ForFork1_#t~ite11_Out1531213498|) (= |P1Thread1of1ForFork1_#t~ite12_Out1531213498| |P1Thread1of1ForFork1_#t~ite11_Out1531213498|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1531213498 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In1531213498 256) 0)) (and (= (mod ~y$r_buff1_thd2~0_In1531213498 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In1531213498 256))))) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_In1531213498| |P1Thread1of1ForFork1_#t~ite11_Out1531213498|) (= |P1Thread1of1ForFork1_#t~ite12_Out1531213498| ~y$w_buff1~0_In1531213498)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1531213498, ~y$w_buff1~0=~y$w_buff1~0_In1531213498, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1531213498, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1531213498, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_In1531213498|, ~weak$$choice2~0=~weak$$choice2~0_In1531213498, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1531213498} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1531213498, ~y$w_buff1~0=~y$w_buff1~0_In1531213498, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1531213498, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1531213498, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1531213498|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1531213498|, ~weak$$choice2~0=~weak$$choice2~0_In1531213498, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1531213498} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-11-28 18:18:48,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L756-->L757: Formula: (and (= v_~y$r_buff0_thd2~0_124 v_~y$r_buff0_thd2~0_123) (not (= (mod v_~weak$$choice2~0_36 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_36} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_13|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_10|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_123, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_6|, ~weak$$choice2~0=v_~weak$$choice2~0_36} 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:18:48,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L759-->L767: Formula: (and (= v_~__unbuffered_cnt~0_24 (+ v_~__unbuffered_cnt~0_25 1)) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11) (= v_~y~0_33 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~y~0=v_~y~0_33, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-11-28 18:18:48,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1848202162 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1848202162 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite28_Out-1848202162|)) (and (= |P2Thread1of1ForFork2_#t~ite28_Out-1848202162| ~y$w_buff0_used~0_In-1848202162) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1848202162, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1848202162} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1848202162, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1848202162, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-1848202162|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-11-28 18:18:48,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L789-->L789-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd3~0_In-1084712709 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1084712709 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1084712709 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-1084712709 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite29_Out-1084712709|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-1084712709 |P2Thread1of1ForFork2_#t~ite29_Out-1084712709|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1084712709, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1084712709, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1084712709, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1084712709} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1084712709, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1084712709, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1084712709, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-1084712709|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1084712709} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-11-28 18:18:48,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L790-->L791: Formula: (let ((.cse1 (= ~y$r_buff0_thd3~0_In262320005 ~y$r_buff0_thd3~0_Out262320005)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In262320005 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In262320005 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= 0 ~y$r_buff0_thd3~0_Out262320005) (not .cse0) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In262320005, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In262320005} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In262320005, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out262320005|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out262320005} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-11-28 18:18:48,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L791-->L791-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd3~0_In-2100144935 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-2100144935 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-2100144935 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-2100144935 256) 0))) (or (and (= ~y$r_buff1_thd3~0_In-2100144935 |P2Thread1of1ForFork2_#t~ite31_Out-2100144935|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork2_#t~ite31_Out-2100144935| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2100144935, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2100144935, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2100144935, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2100144935} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2100144935, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2100144935, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-2100144935|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2100144935, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2100144935} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-11-28 18:18:48,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L791-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_26| v_~y$r_buff1_thd3~0_57) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_57, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_25|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, 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:18:48,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L814-1-->L820: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_23) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:18:48,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L820-2-->L820-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1716712056 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1716712056 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite35_Out-1716712056| ~y$w_buff1~0_In-1716712056)) (and (= |ULTIMATE.start_main_#t~ite35_Out-1716712056| ~y~0_In-1716712056) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1716712056, ~y~0=~y~0_In-1716712056, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1716712056, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1716712056} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1716712056, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1716712056|, ~y~0=~y~0_In-1716712056, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1716712056, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1716712056} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-11-28 18:18:48,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L820-4-->L821: Formula: (= v_~y~0_26 |v_ULTIMATE.start_main_#t~ite35_14|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ~y~0=v_~y~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-11-28 18:18:48,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-465800156 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-465800156 256)))) (or (and (= ~y$w_buff0_used~0_In-465800156 |ULTIMATE.start_main_#t~ite37_Out-465800156|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite37_Out-465800156|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-465800156, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-465800156} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-465800156, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-465800156, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-465800156|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:18:48,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L822-->L822-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In39746591 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In39746591 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In39746591 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In39746591 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite38_Out39746591| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In39746591 |ULTIMATE.start_main_#t~ite38_Out39746591|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In39746591, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In39746591, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In39746591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In39746591} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In39746591, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In39746591, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out39746591|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In39746591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In39746591} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:18:48,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In2139367558 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In2139367558 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite39_Out2139367558| 0)) (and (= |ULTIMATE.start_main_#t~ite39_Out2139367558| ~y$r_buff0_thd0~0_In2139367558) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2139367558, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2139367558} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2139367558, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out2139367558|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2139367558} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:18:48,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L824-->L824-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1107850079 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1107850079 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1107850079 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1107850079 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-1107850079| ~y$r_buff1_thd0~0_In-1107850079) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite40_Out-1107850079| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1107850079, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1107850079, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1107850079, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1107850079} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1107850079|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1107850079, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1107850079, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1107850079, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1107850079} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:18:48,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L824-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~y$r_buff1_thd0~0_136 |v_ULTIMATE.start_main_#t~ite40_46|) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_43) (= v_~x~0_34 2) (= 0 v_~__unbuffered_p2_EAX~0_98))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_21 256))) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~x~0=v_~x~0_34} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~x~0=v_~x~0_34, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_136, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} 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:18:48,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:18:48 BasicIcfg [2019-11-28 18:18:48,899 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:18:48,900 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:18:48,900 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:18:48,900 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:18:48,901 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:18:36" (3/4) ... [2019-11-28 18:18:48,904 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:18:48,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y$w_buff1_used~0_392 0) (= v_~x~0_45 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1394~0.base_31| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1394~0.base_31|) |v_ULTIMATE.start_main_~#t1394~0.offset_23| 0)) |v_#memory_int_17|) (= v_~y$mem_tmp~0_16 0) (= 0 v_~y$r_buff1_thd1~0_88) (= (store .cse0 |v_ULTIMATE.start_main_~#t1394~0.base_31| 1) |v_#valid_62|) (= |v_ULTIMATE.start_main_~#t1394~0.offset_23| 0) (= v_~weak$$choice2~0_148 0) (= v_~y$r_buff0_thd1~0_34 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1394~0.base_31|)) (= v_~y$w_buff0_used~0_595 0) (= v_~y$r_buff1_thd0~0_147 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1394~0.base_31|) (= 0 v_~y$flush_delayed~0_39) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~y$r_buff0_thd3~0_173) (= v_~y$r_buff0_thd0~0_94 0) (= 0 v_~__unbuffered_p2_EAX~0_109) (= 0 v_~y$r_buff0_thd2~0_289) (= v_~y$w_buff1~0_216 0) (= v_~z~0_45 0) (= 0 v_~y$w_buff0~0_304) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p1_EAX~0_57) (= v_~y~0_127 0) (= v_~main$tmp_guard0~0_20 0) (= v_~y$read_delayed~0_5 0) (= v_~main$tmp_guard1~0_32 0) (= |v_#NULL.offset_4| 0) (= 0 v_~y$r_buff1_thd2~0_268) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd3~0_150) (= 0 v_~__unbuffered_cnt~0_97) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1394~0.base_31| 4)) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_19|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t1396~0.base=|v_ULTIMATE.start_main_~#t1396~0.base_23|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$mem_tmp~0=v_~y$mem_tmp~0_16, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_150, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_57, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_34, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_109, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_~#t1394~0.base=|v_ULTIMATE.start_main_~#t1394~0.base_31|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_35|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_33|, ULTIMATE.start_main_~#t1395~0.offset=|v_ULTIMATE.start_main_~#t1395~0.offset_22|, ~weak$$choice0~0=v_~weak$$choice0~0_12, ULTIMATE.start_main_~#t1394~0.offset=|v_ULTIMATE.start_main_~#t1394~0.offset_23|, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_65|, ~y$w_buff1~0=v_~y$w_buff1~0_216, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_289, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_147, ~x~0=v_~x~0_45, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_595, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_~#t1395~0.base=|v_ULTIMATE.start_main_~#t1395~0.base_29|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_88, ~y$w_buff0~0=v_~y$w_buff0~0_304, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_173, ULTIMATE.start_main_~#t1396~0.offset=|v_ULTIMATE.start_main_~#t1396~0.offset_15|, ~y~0=v_~y~0_127, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_29|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_33|, ~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_268, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_94, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_45, ~weak$$choice2~0=v_~weak$$choice2~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1395~0.base, ULTIMATE.start_main_~#t1396~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1396~0.offset, ~y~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1394~0.base, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1395~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1394~0.offset, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:18:48,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L810-1-->L812: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1395~0.base_9| 0)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1395~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1395~0.base_9|) |v_ULTIMATE.start_main_~#t1395~0.offset_9| 1)) |v_#memory_int_9|) (= |v_ULTIMATE.start_main_~#t1395~0.offset_9| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1395~0.base_9|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1395~0.base_9| 4)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1395~0.base_9|)) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1395~0.base_9| 1) |v_#valid_31|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1395~0.offset=|v_ULTIMATE.start_main_~#t1395~0.offset_9|, ULTIMATE.start_main_~#t1395~0.base=|v_ULTIMATE.start_main_~#t1395~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1395~0.offset, ULTIMATE.start_main_~#t1395~0.base] because there is no mapped edge [2019-11-28 18:18:48,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L812-1-->L814: Formula: (and (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1396~0.base_10| 1)) (= |v_ULTIMATE.start_main_~#t1396~0.offset_9| 0) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1396~0.base_10|)) (not (= 0 |v_ULTIMATE.start_main_~#t1396~0.base_10|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1396~0.base_10|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1396~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1396~0.base_10|) |v_ULTIMATE.start_main_~#t1396~0.offset_9| 2)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1396~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1396~0.base=|v_ULTIMATE.start_main_~#t1396~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1396~0.offset=|v_ULTIMATE.start_main_~#t1396~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1396~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1396~0.offset] because there is no mapped edge [2019-11-28 18:18:48,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [610] [610] L4-->L787: Formula: (and (= v_~y$r_buff0_thd2~0_62 v_~y$r_buff1_thd2~0_26) (= v_~__unbuffered_p2_EAX~0_4 v_~z~0_4) (= v_~y$r_buff0_thd3~0_25 1) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18)) (= v_~y$r_buff1_thd1~0_3 v_~y$r_buff0_thd1~0_4) (= v_~y$r_buff0_thd0~0_15 v_~y$r_buff1_thd0~0_10) (= v_~y$r_buff0_thd3~0_26 v_~y$r_buff1_thd3~0_26)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18, ~z~0=v_~z~0_4} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_26, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_3, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_26, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_4, ~z~0=v_~z~0_4, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:18:48,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_10|) (= v_~z~0_32 1) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_10|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63) (= v_~x~0_16 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~z~0=v_~z~0_32, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, ~x~0=v_~x~0_16, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:18:48,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L752-->L752-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In423785213 256) 0))) (or (and (not .cse0) (= ~y$w_buff0~0_In423785213 |P1Thread1of1ForFork1_#t~ite9_Out423785213|) (= |P1Thread1of1ForFork1_#t~ite8_In423785213| |P1Thread1of1ForFork1_#t~ite8_Out423785213|)) (and (= |P1Thread1of1ForFork1_#t~ite8_Out423785213| ~y$w_buff0~0_In423785213) .cse0 (= |P1Thread1of1ForFork1_#t~ite8_Out423785213| |P1Thread1of1ForFork1_#t~ite9_Out423785213|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In423785213 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In423785213 256)) (and (= 0 (mod ~y$r_buff1_thd2~0_In423785213 256)) .cse1) (and (= (mod ~y$w_buff1_used~0_In423785213 256) 0) .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In423785213, ~y$w_buff0_used~0=~y$w_buff0_used~0_In423785213, ~y$w_buff0~0=~y$w_buff0~0_In423785213, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In423785213, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In423785213|, ~weak$$choice2~0=~weak$$choice2~0_In423785213, ~y$w_buff1_used~0=~y$w_buff1_used~0_In423785213} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In423785213, ~y$w_buff0_used~0=~y$w_buff0_used~0_In423785213, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out423785213|, ~y$w_buff0~0=~y$w_buff0~0_In423785213, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In423785213, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out423785213|, ~weak$$choice2~0=~weak$$choice2~0_In423785213, ~y$w_buff1_used~0=~y$w_buff1_used~0_In423785213} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-11-28 18:18:48,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L753-->L753-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1531213498 256)))) (or (and .cse0 (= ~y$w_buff1~0_In1531213498 |P1Thread1of1ForFork1_#t~ite11_Out1531213498|) (= |P1Thread1of1ForFork1_#t~ite12_Out1531213498| |P1Thread1of1ForFork1_#t~ite11_Out1531213498|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1531213498 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In1531213498 256) 0)) (and (= (mod ~y$r_buff1_thd2~0_In1531213498 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In1531213498 256))))) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_In1531213498| |P1Thread1of1ForFork1_#t~ite11_Out1531213498|) (= |P1Thread1of1ForFork1_#t~ite12_Out1531213498| ~y$w_buff1~0_In1531213498)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1531213498, ~y$w_buff1~0=~y$w_buff1~0_In1531213498, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1531213498, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1531213498, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_In1531213498|, ~weak$$choice2~0=~weak$$choice2~0_In1531213498, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1531213498} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1531213498, ~y$w_buff1~0=~y$w_buff1~0_In1531213498, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1531213498, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1531213498, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1531213498|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1531213498|, ~weak$$choice2~0=~weak$$choice2~0_In1531213498, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1531213498} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-11-28 18:18:48,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L756-->L757: Formula: (and (= v_~y$r_buff0_thd2~0_124 v_~y$r_buff0_thd2~0_123) (not (= (mod v_~weak$$choice2~0_36 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_36} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_13|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_10|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_123, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_6|, ~weak$$choice2~0=v_~weak$$choice2~0_36} 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:18:48,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L759-->L767: Formula: (and (= v_~__unbuffered_cnt~0_24 (+ v_~__unbuffered_cnt~0_25 1)) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11) (= v_~y~0_33 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~y~0=v_~y~0_33, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-11-28 18:18:48,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1848202162 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1848202162 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite28_Out-1848202162|)) (and (= |P2Thread1of1ForFork2_#t~ite28_Out-1848202162| ~y$w_buff0_used~0_In-1848202162) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1848202162, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1848202162} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1848202162, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1848202162, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-1848202162|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-11-28 18:18:48,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L789-->L789-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd3~0_In-1084712709 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1084712709 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1084712709 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-1084712709 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite29_Out-1084712709|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-1084712709 |P2Thread1of1ForFork2_#t~ite29_Out-1084712709|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1084712709, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1084712709, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1084712709, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1084712709} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1084712709, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1084712709, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1084712709, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-1084712709|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1084712709} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-11-28 18:18:48,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L790-->L791: Formula: (let ((.cse1 (= ~y$r_buff0_thd3~0_In262320005 ~y$r_buff0_thd3~0_Out262320005)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In262320005 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In262320005 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= 0 ~y$r_buff0_thd3~0_Out262320005) (not .cse0) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In262320005, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In262320005} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In262320005, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out262320005|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out262320005} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-11-28 18:18:48,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L791-->L791-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd3~0_In-2100144935 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-2100144935 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-2100144935 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-2100144935 256) 0))) (or (and (= ~y$r_buff1_thd3~0_In-2100144935 |P2Thread1of1ForFork2_#t~ite31_Out-2100144935|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork2_#t~ite31_Out-2100144935| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2100144935, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2100144935, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2100144935, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2100144935} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2100144935, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2100144935, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-2100144935|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2100144935, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2100144935} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-11-28 18:18:48,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L791-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_26| v_~y$r_buff1_thd3~0_57) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_57, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_25|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, 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:18:48,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L814-1-->L820: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_23) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:18:48,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L820-2-->L820-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1716712056 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1716712056 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite35_Out-1716712056| ~y$w_buff1~0_In-1716712056)) (and (= |ULTIMATE.start_main_#t~ite35_Out-1716712056| ~y~0_In-1716712056) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1716712056, ~y~0=~y~0_In-1716712056, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1716712056, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1716712056} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1716712056, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1716712056|, ~y~0=~y~0_In-1716712056, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1716712056, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1716712056} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-11-28 18:18:48,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L820-4-->L821: Formula: (= v_~y~0_26 |v_ULTIMATE.start_main_#t~ite35_14|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ~y~0=v_~y~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-11-28 18:18:48,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-465800156 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-465800156 256)))) (or (and (= ~y$w_buff0_used~0_In-465800156 |ULTIMATE.start_main_#t~ite37_Out-465800156|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite37_Out-465800156|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-465800156, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-465800156} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-465800156, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-465800156, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-465800156|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:18:48,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L822-->L822-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In39746591 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In39746591 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In39746591 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In39746591 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite38_Out39746591| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In39746591 |ULTIMATE.start_main_#t~ite38_Out39746591|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In39746591, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In39746591, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In39746591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In39746591} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In39746591, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In39746591, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out39746591|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In39746591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In39746591} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:18:48,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In2139367558 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In2139367558 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite39_Out2139367558| 0)) (and (= |ULTIMATE.start_main_#t~ite39_Out2139367558| ~y$r_buff0_thd0~0_In2139367558) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2139367558, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2139367558} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2139367558, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out2139367558|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2139367558} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:18:48,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L824-->L824-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1107850079 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1107850079 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1107850079 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1107850079 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-1107850079| ~y$r_buff1_thd0~0_In-1107850079) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite40_Out-1107850079| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1107850079, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1107850079, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1107850079, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1107850079} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1107850079|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1107850079, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1107850079, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1107850079, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1107850079} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:18:48,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L824-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~y$r_buff1_thd0~0_136 |v_ULTIMATE.start_main_#t~ite40_46|) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_43) (= v_~x~0_34 2) (= 0 v_~__unbuffered_p2_EAX~0_98))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_21 256))) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~x~0=v_~x~0_34} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~x~0=v_~x~0_34, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_136, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} 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:18:49,030 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:18:49,031 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:18:49,033 INFO L168 Benchmark]: Toolchain (without parser) took 14665.86 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 554.2 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -102.6 MB). Peak memory consumption was 451.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:18:49,038 INFO L168 Benchmark]: CDTParser took 0.32 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:18:49,042 INFO L168 Benchmark]: CACSL2BoogieTranslator took 838.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -146.9 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-28 18:18:49,043 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.73 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:18:49,043 INFO L168 Benchmark]: Boogie Preprocessor took 47.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:18:49,044 INFO L168 Benchmark]: RCFGBuilder took 815.26 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: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:18:49,044 INFO L168 Benchmark]: TraceAbstraction took 12752.69 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 417.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -34.0 MB). Peak memory consumption was 383.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:18:49,045 INFO L168 Benchmark]: Witness Printer took 130.87 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:18:49,049 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.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 838.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -146.9 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 75.73 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 815.26 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: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12752.69 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 417.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -34.0 MB). Peak memory consumption was 383.8 MB. Max. memory is 11.5 GB. * Witness Printer took 130.87 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 151 ProgramPointsBefore, 72 ProgramPointsAfterwards, 176 TransitionsBefore, 80 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 21 ChoiceCompositions, 5098 VarBasedMoverChecksPositive, 188 VarBasedMoverChecksNegative, 63 SemBasedMoverChecksPositive, 154 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 39870 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t1394, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L812] FCALL, FORK 0 pthread_create(&t1395, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L814] FCALL, FORK 0 pthread_create(&t1396, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L772] 3 y$w_buff1 = y$w_buff0 [L773] 3 y$w_buff0 = 1 [L774] 3 y$w_buff1_used = y$w_buff0_used [L775] 3 y$w_buff0_used = (_Bool)1 [L787] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=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=0] [L744] 2 x = 2 [L747] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 2 y$flush_delayed = weak$$choice2 [L750] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, 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=2, 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] [L751] 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_p1_EAX=0, __unbuffered_p2_EAX=0, 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=2, 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] [L751] 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) [L752] 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)) [L753] 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)) [L754] 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_p1_EAX=0, __unbuffered_p2_EAX=0, 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=2, 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] [L754] 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)) [L755] 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_p1_EAX=0, __unbuffered_p2_EAX=0, 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=2, 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] [L755] 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)) [L757] EXPR 2 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)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, 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$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))=0, x=2, 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$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)) [L758] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, 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=2, 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] [L787] 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) [L788] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L789] 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 [L820] 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_p1_EAX=0, __unbuffered_p2_EAX=0, 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=2, 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] [L821] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L822] 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 [L823] 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, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.4s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1622 SDtfs, 1333 SDslu, 2514 SDs, 0 SdLazy, 1175 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12726occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 4431 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 465 NumberOfCodeBlocks, 465 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 406 ConstructedInterpolants, 0 QuantifiedInterpolants, 62932 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...