./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix054_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix054_power.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf2cd00fabce720f4c3f98371101c93927116a53 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:19:15,096 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:19:15,099 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:19:15,114 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:19:15,115 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:19:15,116 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:19:15,118 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:19:15,119 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:19:15,121 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:19:15,122 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:19:15,123 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:19:15,125 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:19:15,125 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:19:15,126 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:19:15,127 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:19:15,129 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:19:15,130 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:19:15,131 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:19:15,133 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:19:15,136 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:19:15,138 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:19:15,139 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:19:15,141 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:19:15,141 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:19:15,144 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:19:15,144 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:19:15,145 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:19:15,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:19:15,146 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:19:15,147 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:19:15,148 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:19:15,149 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:19:15,150 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:19:15,150 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:19:15,152 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:19:15,152 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:19:15,153 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:19:15,153 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:19:15,153 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:19:15,155 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:19:15,155 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:19:15,156 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:19:15,179 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:19:15,180 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:19:15,182 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:19:15,182 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:19:15,182 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:19:15,183 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:19:15,183 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:19:15,184 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:19:15,184 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:19:15,184 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:19:15,185 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:19:15,186 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:19:15,188 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:19:15,189 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:19:15,189 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:19:15,190 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:19:15,190 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:19:15,190 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:19:15,191 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:19:15,191 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:19:15,192 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:19:15,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:19:15,192 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:19:15,193 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:19:15,193 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:19:15,193 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:19:15,193 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:19:15,194 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:19:15,194 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:19:15,194 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 -> bf2cd00fabce720f4c3f98371101c93927116a53 [2019-11-28 18:19:15,562 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:19:15,582 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:19:15,587 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:19:15,589 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:19:15,589 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:19:15,590 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix054_power.oepc.i [2019-11-28 18:19:15,664 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a343d7eee/d923decf25fd4207964574a78645bad8/FLAGda4fd3e59 [2019-11-28 18:19:16,217 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:19:16,219 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix054_power.oepc.i [2019-11-28 18:19:16,245 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a343d7eee/d923decf25fd4207964574a78645bad8/FLAGda4fd3e59 [2019-11-28 18:19:16,556 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a343d7eee/d923decf25fd4207964574a78645bad8 [2019-11-28 18:19:16,559 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:19:16,561 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:19:16,562 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:19:16,562 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:19:16,565 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:19:16,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:19:16" (1/1) ... [2019-11-28 18:19:16,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38cd1333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:16, skipping insertion in model container [2019-11-28 18:19:16,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:19:16" (1/1) ... [2019-11-28 18:19:16,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:19:16,642 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:19:17,120 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:19:17,133 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:19:17,232 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:19:17,319 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:19:17,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:17 WrapperNode [2019-11-28 18:19:17,320 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:19:17,320 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:19:17,320 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:19:17,320 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:19:17,327 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:19:17" (1/1) ... [2019-11-28 18:19:17,349 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:19:17" (1/1) ... [2019-11-28 18:19:17,379 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:19:17,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:19:17,380 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:19:17,380 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:19:17,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:17" (1/1) ... [2019-11-28 18:19:17,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:17" (1/1) ... [2019-11-28 18:19:17,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:17" (1/1) ... [2019-11-28 18:19:17,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:17" (1/1) ... [2019-11-28 18:19:17,410 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:17" (1/1) ... [2019-11-28 18:19:17,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:17" (1/1) ... [2019-11-28 18:19:17,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:17" (1/1) ... [2019-11-28 18:19:17,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:19:17,424 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:19:17,424 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:19:17,424 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:19:17,425 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:17" (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:19:17,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:19:17,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:19:17,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:19:17,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:19:17,495 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:19:17,495 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:19:17,495 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:19:17,495 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:19:17,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:19:17,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:19:17,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:19:17,498 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:19:18,219 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:19:18,220 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:19:18,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:19:18 BoogieIcfgContainer [2019-11-28 18:19:18,221 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:19:18,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:19:18,222 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:19:18,225 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:19:18,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:19:16" (1/3) ... [2019-11-28 18:19:18,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d951f0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:19:18, skipping insertion in model container [2019-11-28 18:19:18,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:17" (2/3) ... [2019-11-28 18:19:18,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d951f0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:19:18, skipping insertion in model container [2019-11-28 18:19:18,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:19:18" (3/3) ... [2019-11-28 18:19:18,230 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_power.oepc.i [2019-11-28 18:19:18,240 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:19:18,240 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:19:18,251 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:19:18,253 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:19:18,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,294 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,295 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,295 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,296 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,296 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,314 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,315 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:18,360 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:19:18,382 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:19:18,382 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:19:18,382 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:19:18,382 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:19:18,383 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:19:18,383 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:19:18,383 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:19:18,383 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:19:18,403 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-11-28 18:19:18,405 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-11-28 18:19:18,492 INFO L134 PetriNetUnfolder]: 41/178 cut-off events. [2019-11-28 18:19:18,492 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:19:18,509 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 577 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:19:18,533 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-11-28 18:19:18,581 INFO L134 PetriNetUnfolder]: 41/178 cut-off events. [2019-11-28 18:19:18,582 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:19:18,597 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 577 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:19:18,615 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-11-28 18:19:18,616 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:19:23,383 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-11-28 18:19:23,805 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74785 [2019-11-28 18:19:23,805 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-11-28 18:19:23,810 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 85 transitions [2019-11-28 18:19:24,521 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8582 states. [2019-11-28 18:19:24,525 INFO L276 IsEmpty]: Start isEmpty. Operand 8582 states. [2019-11-28 18:19:24,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 18:19:24,533 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:24,535 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 18:19:24,535 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:24,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:24,545 INFO L82 PathProgramCache]: Analyzing trace with hash 791214, now seen corresponding path program 1 times [2019-11-28 18:19:24,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:24,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444036057] [2019-11-28 18:19:24,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:24,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:24,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:19:24,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444036057] [2019-11-28 18:19:24,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:24,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:19:24,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476419315] [2019-11-28 18:19:24,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:19:24,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:24,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:19:24,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:19:24,916 INFO L87 Difference]: Start difference. First operand 8582 states. Second operand 3 states. [2019-11-28 18:19:25,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:25,261 INFO L93 Difference]: Finished difference Result 8460 states and 27514 transitions. [2019-11-28 18:19:25,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:19:25,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 18:19:25,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:25,382 INFO L225 Difference]: With dead ends: 8460 [2019-11-28 18:19:25,385 INFO L226 Difference]: Without dead ends: 7472 [2019-11-28 18:19:25,389 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:19:25,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7472 states. [2019-11-28 18:19:25,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7472 to 7472. [2019-11-28 18:19:25,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7472 states. [2019-11-28 18:19:25,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7472 states to 7472 states and 24214 transitions. [2019-11-28 18:19:25,828 INFO L78 Accepts]: Start accepts. Automaton has 7472 states and 24214 transitions. Word has length 3 [2019-11-28 18:19:25,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:25,829 INFO L462 AbstractCegarLoop]: Abstraction has 7472 states and 24214 transitions. [2019-11-28 18:19:25,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:19:25,829 INFO L276 IsEmpty]: Start isEmpty. Operand 7472 states and 24214 transitions. [2019-11-28 18:19:25,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:19:25,833 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:25,833 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:19:25,834 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:25,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:25,835 INFO L82 PathProgramCache]: Analyzing trace with hash 743461303, now seen corresponding path program 1 times [2019-11-28 18:19:25,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:25,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188423600] [2019-11-28 18:19:25,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:25,963 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:19:25,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188423600] [2019-11-28 18:19:25,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:25,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:19:25,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930581892] [2019-11-28 18:19:25,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:19:25,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:25,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:19:25,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:19:25,970 INFO L87 Difference]: Start difference. First operand 7472 states and 24214 transitions. Second operand 4 states. [2019-11-28 18:19:26,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:26,497 INFO L93 Difference]: Finished difference Result 11704 states and 36249 transitions. [2019-11-28 18:19:26,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:19:26,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:19:26,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:26,598 INFO L225 Difference]: With dead ends: 11704 [2019-11-28 18:19:26,598 INFO L226 Difference]: Without dead ends: 11690 [2019-11-28 18:19:26,599 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:19:26,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11690 states. [2019-11-28 18:19:26,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11690 to 10458. [2019-11-28 18:19:26,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10458 states. [2019-11-28 18:19:27,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10458 states to 10458 states and 32991 transitions. [2019-11-28 18:19:27,007 INFO L78 Accepts]: Start accepts. Automaton has 10458 states and 32991 transitions. Word has length 11 [2019-11-28 18:19:27,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:27,007 INFO L462 AbstractCegarLoop]: Abstraction has 10458 states and 32991 transitions. [2019-11-28 18:19:27,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:19:27,008 INFO L276 IsEmpty]: Start isEmpty. Operand 10458 states and 32991 transitions. [2019-11-28 18:19:27,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:19:27,017 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:27,018 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:19:27,018 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:27,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:27,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1209900993, now seen corresponding path program 1 times [2019-11-28 18:19:27,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:27,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138626413] [2019-11-28 18:19:27,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:27,173 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:19:27,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138626413] [2019-11-28 18:19:27,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:27,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:19:27,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800194911] [2019-11-28 18:19:27,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:19:27,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:27,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:19:27,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:19:27,176 INFO L87 Difference]: Start difference. First operand 10458 states and 32991 transitions. Second operand 5 states. [2019-11-28 18:19:27,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:27,606 INFO L93 Difference]: Finished difference Result 15000 states and 46671 transitions. [2019-11-28 18:19:27,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:19:27,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-28 18:19:27,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:27,664 INFO L225 Difference]: With dead ends: 15000 [2019-11-28 18:19:27,664 INFO L226 Difference]: Without dead ends: 15000 [2019-11-28 18:19:27,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:19:27,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15000 states. [2019-11-28 18:19:28,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15000 to 11886. [2019-11-28 18:19:28,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11886 states. [2019-11-28 18:19:28,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11886 states to 11886 states and 37489 transitions. [2019-11-28 18:19:28,112 INFO L78 Accepts]: Start accepts. Automaton has 11886 states and 37489 transitions. Word has length 14 [2019-11-28 18:19:28,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:28,113 INFO L462 AbstractCegarLoop]: Abstraction has 11886 states and 37489 transitions. [2019-11-28 18:19:28,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:19:28,113 INFO L276 IsEmpty]: Start isEmpty. Operand 11886 states and 37489 transitions. [2019-11-28 18:19:28,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:19:28,117 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:28,117 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:19:28,118 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:28,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:28,118 INFO L82 PathProgramCache]: Analyzing trace with hash 529414606, now seen corresponding path program 1 times [2019-11-28 18:19:28,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:28,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533120967] [2019-11-28 18:19:28,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:28,235 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:19:28,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533120967] [2019-11-28 18:19:28,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:28,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:19:28,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563879925] [2019-11-28 18:19:28,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:19:28,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:28,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:19:28,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:19:28,237 INFO L87 Difference]: Start difference. First operand 11886 states and 37489 transitions. Second operand 3 states. [2019-11-28 18:19:28,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:28,293 INFO L93 Difference]: Finished difference Result 11886 states and 36968 transitions. [2019-11-28 18:19:28,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:19:28,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:19:28,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:28,331 INFO L225 Difference]: With dead ends: 11886 [2019-11-28 18:19:28,331 INFO L226 Difference]: Without dead ends: 11886 [2019-11-28 18:19:28,332 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:19:28,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11886 states. [2019-11-28 18:19:28,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11886 to 11798. [2019-11-28 18:19:28,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11798 states. [2019-11-28 18:19:28,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11798 states to 11798 states and 36712 transitions. [2019-11-28 18:19:28,811 INFO L78 Accepts]: Start accepts. Automaton has 11798 states and 36712 transitions. Word has length 16 [2019-11-28 18:19:28,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:28,811 INFO L462 AbstractCegarLoop]: Abstraction has 11798 states and 36712 transitions. [2019-11-28 18:19:28,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:19:28,811 INFO L276 IsEmpty]: Start isEmpty. Operand 11798 states and 36712 transitions. [2019-11-28 18:19:28,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:19:28,815 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:28,815 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:19:28,815 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:28,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:28,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1560475965, now seen corresponding path program 1 times [2019-11-28 18:19:28,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:28,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89653936] [2019-11-28 18:19:28,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:28,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:19:28,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89653936] [2019-11-28 18:19:28,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:28,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:19:28,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967815736] [2019-11-28 18:19:28,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:19:28,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:28,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:19:28,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:19:28,885 INFO L87 Difference]: Start difference. First operand 11798 states and 36712 transitions. Second operand 3 states. [2019-11-28 18:19:28,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:28,969 INFO L93 Difference]: Finished difference Result 20097 states and 61984 transitions. [2019-11-28 18:19:28,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:19:28,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:19:28,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:29,014 INFO L225 Difference]: With dead ends: 20097 [2019-11-28 18:19:29,014 INFO L226 Difference]: Without dead ends: 17619 [2019-11-28 18:19:29,014 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:19:29,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17619 states. [2019-11-28 18:19:29,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17619 to 16855. [2019-11-28 18:19:29,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16855 states. [2019-11-28 18:19:29,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16855 states to 16855 states and 52512 transitions. [2019-11-28 18:19:29,506 INFO L78 Accepts]: Start accepts. Automaton has 16855 states and 52512 transitions. Word has length 16 [2019-11-28 18:19:29,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:29,506 INFO L462 AbstractCegarLoop]: Abstraction has 16855 states and 52512 transitions. [2019-11-28 18:19:29,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:19:29,507 INFO L276 IsEmpty]: Start isEmpty. Operand 16855 states and 52512 transitions. [2019-11-28 18:19:29,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 18:19:29,513 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:29,513 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:19:29,514 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:29,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:29,514 INFO L82 PathProgramCache]: Analyzing trace with hash 783398497, now seen corresponding path program 1 times [2019-11-28 18:19:29,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:29,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845486807] [2019-11-28 18:19:29,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:29,583 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:19:29,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845486807] [2019-11-28 18:19:29,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:29,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:19:29,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106969263] [2019-11-28 18:19:29,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:19:29,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:29,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:19:29,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:19:29,587 INFO L87 Difference]: Start difference. First operand 16855 states and 52512 transitions. Second operand 4 states. [2019-11-28 18:19:29,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:29,625 INFO L93 Difference]: Finished difference Result 2989 states and 7615 transitions. [2019-11-28 18:19:29,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:19:29,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-28 18:19:29,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:29,630 INFO L225 Difference]: With dead ends: 2989 [2019-11-28 18:19:29,631 INFO L226 Difference]: Without dead ends: 2059 [2019-11-28 18:19:29,631 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:19:29,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2059 states. [2019-11-28 18:19:29,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2059 to 2059. [2019-11-28 18:19:29,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2059 states. [2019-11-28 18:19:29,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2059 states to 2059 states and 4626 transitions. [2019-11-28 18:19:29,672 INFO L78 Accepts]: Start accepts. Automaton has 2059 states and 4626 transitions. Word has length 17 [2019-11-28 18:19:29,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:29,672 INFO L462 AbstractCegarLoop]: Abstraction has 2059 states and 4626 transitions. [2019-11-28 18:19:29,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:19:29,673 INFO L276 IsEmpty]: Start isEmpty. Operand 2059 states and 4626 transitions. [2019-11-28 18:19:29,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 18:19:29,677 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:29,677 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:19:29,678 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:29,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:29,678 INFO L82 PathProgramCache]: Analyzing trace with hash 702739982, now seen corresponding path program 1 times [2019-11-28 18:19:29,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:29,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156201883] [2019-11-28 18:19:29,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:29,820 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:19:29,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156201883] [2019-11-28 18:19:29,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:29,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:19:29,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603495971] [2019-11-28 18:19:29,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:19:29,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:29,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:19:29,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:19:29,824 INFO L87 Difference]: Start difference. First operand 2059 states and 4626 transitions. Second operand 6 states. [2019-11-28 18:19:30,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:30,274 INFO L93 Difference]: Finished difference Result 2885 states and 6208 transitions. [2019-11-28 18:19:30,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:19:30,275 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-28 18:19:30,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:30,280 INFO L225 Difference]: With dead ends: 2885 [2019-11-28 18:19:30,281 INFO L226 Difference]: Without dead ends: 2834 [2019-11-28 18:19:30,282 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 18:19:30,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2019-11-28 18:19:30,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2017. [2019-11-28 18:19:30,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2017 states. [2019-11-28 18:19:30,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 4535 transitions. [2019-11-28 18:19:30,325 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 4535 transitions. Word has length 25 [2019-11-28 18:19:30,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:30,326 INFO L462 AbstractCegarLoop]: Abstraction has 2017 states and 4535 transitions. [2019-11-28 18:19:30,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:19:30,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 4535 transitions. [2019-11-28 18:19:30,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 18:19:30,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:30,332 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:19:30,332 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:30,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:30,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1134333202, now seen corresponding path program 1 times [2019-11-28 18:19:30,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:30,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969589869] [2019-11-28 18:19:30,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:30,441 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:19:30,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969589869] [2019-11-28 18:19:30,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:30,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:19:30,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493633742] [2019-11-28 18:19:30,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:19:30,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:30,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:19:30,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:19:30,444 INFO L87 Difference]: Start difference. First operand 2017 states and 4535 transitions. Second operand 5 states. [2019-11-28 18:19:30,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:30,487 INFO L93 Difference]: Finished difference Result 1101 states and 2460 transitions. [2019-11-28 18:19:30,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:19:30,487 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-28 18:19:30,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:30,489 INFO L225 Difference]: With dead ends: 1101 [2019-11-28 18:19:30,490 INFO L226 Difference]: Without dead ends: 983 [2019-11-28 18:19:30,490 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:19:30,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2019-11-28 18:19:30,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 707. [2019-11-28 18:19:30,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2019-11-28 18:19:30,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1554 transitions. [2019-11-28 18:19:30,504 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1554 transitions. Word has length 28 [2019-11-28 18:19:30,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:30,504 INFO L462 AbstractCegarLoop]: Abstraction has 707 states and 1554 transitions. [2019-11-28 18:19:30,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:19:30,505 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1554 transitions. [2019-11-28 18:19:30,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:19:30,509 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:30,510 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:19:30,510 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:30,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:30,511 INFO L82 PathProgramCache]: Analyzing trace with hash 2108814601, now seen corresponding path program 1 times [2019-11-28 18:19:30,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:30,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067654008] [2019-11-28 18:19:30,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:30,567 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:19:30,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067654008] [2019-11-28 18:19:30,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:30,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:19:30,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201123129] [2019-11-28 18:19:30,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:19:30,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:30,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:19:30,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:19:30,571 INFO L87 Difference]: Start difference. First operand 707 states and 1554 transitions. Second operand 3 states. [2019-11-28 18:19:30,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:30,614 INFO L93 Difference]: Finished difference Result 1066 states and 2274 transitions. [2019-11-28 18:19:30,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:19:30,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-28 18:19:30,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:30,617 INFO L225 Difference]: With dead ends: 1066 [2019-11-28 18:19:30,619 INFO L226 Difference]: Without dead ends: 1066 [2019-11-28 18:19:30,619 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:19:30,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2019-11-28 18:19:30,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 806. [2019-11-28 18:19:30,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2019-11-28 18:19:30,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1751 transitions. [2019-11-28 18:19:30,648 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1751 transitions. Word has length 52 [2019-11-28 18:19:30,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:30,648 INFO L462 AbstractCegarLoop]: Abstraction has 806 states and 1751 transitions. [2019-11-28 18:19:30,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:19:30,649 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1751 transitions. [2019-11-28 18:19:30,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:19:30,655 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:30,656 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:19:30,656 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:30,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:30,657 INFO L82 PathProgramCache]: Analyzing trace with hash -525709791, now seen corresponding path program 1 times [2019-11-28 18:19:30,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:30,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251142343] [2019-11-28 18:19:30,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:30,818 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:19:30,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251142343] [2019-11-28 18:19:30,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:30,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 18:19:30,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988895861] [2019-11-28 18:19:30,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:19:30,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:30,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:19:30,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:19:30,822 INFO L87 Difference]: Start difference. First operand 806 states and 1751 transitions. Second operand 7 states. [2019-11-28 18:19:31,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:31,695 INFO L93 Difference]: Finished difference Result 1466 states and 3066 transitions. [2019-11-28 18:19:31,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 18:19:31,696 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-28 18:19:31,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:31,699 INFO L225 Difference]: With dead ends: 1466 [2019-11-28 18:19:31,699 INFO L226 Difference]: Without dead ends: 1466 [2019-11-28 18:19:31,699 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-28 18:19:31,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2019-11-28 18:19:31,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1013. [2019-11-28 18:19:31,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2019-11-28 18:19:31,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 2183 transitions. [2019-11-28 18:19:31,715 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 2183 transitions. Word has length 52 [2019-11-28 18:19:31,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:31,716 INFO L462 AbstractCegarLoop]: Abstraction has 1013 states and 2183 transitions. [2019-11-28 18:19:31,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:19:31,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 2183 transitions. [2019-11-28 18:19:31,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:19:31,719 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:31,719 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:19:31,719 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:31,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:31,719 INFO L82 PathProgramCache]: Analyzing trace with hash -346039067, now seen corresponding path program 2 times [2019-11-28 18:19:31,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:31,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41473835] [2019-11-28 18:19:31,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:31,836 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:19:31,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41473835] [2019-11-28 18:19:31,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:31,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:19:31,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119059817] [2019-11-28 18:19:31,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:19:31,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:31,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:19:31,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:19:31,838 INFO L87 Difference]: Start difference. First operand 1013 states and 2183 transitions. Second operand 7 states. [2019-11-28 18:19:32,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:32,230 INFO L93 Difference]: Finished difference Result 3614 states and 7677 transitions. [2019-11-28 18:19:32,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 18:19:32,230 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-28 18:19:32,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:32,234 INFO L225 Difference]: With dead ends: 3614 [2019-11-28 18:19:32,234 INFO L226 Difference]: Without dead ends: 2415 [2019-11-28 18:19:32,235 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-11-28 18:19:32,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2415 states. [2019-11-28 18:19:32,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2415 to 1060. [2019-11-28 18:19:32,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2019-11-28 18:19:32,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 2272 transitions. [2019-11-28 18:19:32,260 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 2272 transitions. Word has length 52 [2019-11-28 18:19:32,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:32,261 INFO L462 AbstractCegarLoop]: Abstraction has 1060 states and 2272 transitions. [2019-11-28 18:19:32,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:19:32,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 2272 transitions. [2019-11-28 18:19:32,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:19:32,264 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:32,264 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:19:32,264 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:32,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:32,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1667381275, now seen corresponding path program 3 times [2019-11-28 18:19:32,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:32,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370935218] [2019-11-28 18:19:32,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:32,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:32,388 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:19:32,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370935218] [2019-11-28 18:19:32,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:32,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:19:32,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118337228] [2019-11-28 18:19:32,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:19:32,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:32,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:19:32,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:19:32,391 INFO L87 Difference]: Start difference. First operand 1060 states and 2272 transitions. Second operand 5 states. [2019-11-28 18:19:32,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:32,455 INFO L93 Difference]: Finished difference Result 1296 states and 2760 transitions. [2019-11-28 18:19:32,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:19:32,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-11-28 18:19:32,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:32,458 INFO L225 Difference]: With dead ends: 1296 [2019-11-28 18:19:32,458 INFO L226 Difference]: Without dead ends: 1296 [2019-11-28 18:19:32,458 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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:19:32,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2019-11-28 18:19:32,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 976. [2019-11-28 18:19:32,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2019-11-28 18:19:32,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 2123 transitions. [2019-11-28 18:19:32,475 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 2123 transitions. Word has length 52 [2019-11-28 18:19:32,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:32,476 INFO L462 AbstractCegarLoop]: Abstraction has 976 states and 2123 transitions. [2019-11-28 18:19:32,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:19:32,476 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 2123 transitions. [2019-11-28 18:19:32,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:19:32,479 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:32,479 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:19:32,479 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:32,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:32,480 INFO L82 PathProgramCache]: Analyzing trace with hash -288059161, now seen corresponding path program 1 times [2019-11-28 18:19:32,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:32,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079461932] [2019-11-28 18:19:32,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:19:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:19:32,626 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:19:32,627 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:19:32,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] ULTIMATE.startENTRY-->L792: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff1_thd2~0_239) (= 0 v_~y$flush_delayed~0_31) (= v_~main$tmp_guard0~0_30 0) (= v_~x~0_98 0) (= v_~y~0_135 0) (= |v_#NULL.offset_3| 0) (= v_~y$mem_tmp~0_22 0) (= v_~y$r_buff1_thd1~0_110 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1441~0.base_35| 1) |v_#valid_57|) (= v_~y$r_buff0_thd1~0_187 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1441~0.base_35| 4)) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~y$w_buff0_used~0_704 0) (= v_~main$tmp_guard1~0_45 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1441~0.base_35|)) (= v_~y$r_buff0_thd0~0_135 0) (= v_~y$r_buff1_thd0~0_153 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_cnt~0_51) (< 0 |v_#StackHeapBarrier_14|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1441~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1441~0.base_35|) |v_ULTIMATE.start_main_~#t1441~0.offset_27| 0)) |v_#memory_int_15|) (= 0 v_~y$r_buff0_thd2~0_327) (= 0 v_~weak$$choice0~0_20) (= v_~y$w_buff1_used~0_445 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1441~0.base_35|) (= 0 |v_#NULL.base_3|) (= |v_ULTIMATE.start_main_~#t1441~0.offset_27| 0) (= v_~weak$$choice2~0_107 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$w_buff1~0_286 0) (= 0 v_~y$w_buff0~0_484))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{~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_704, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_39|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_78|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_47|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_110, ~y$mem_tmp~0=v_~y$mem_tmp~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~y$w_buff0~0=v_~y$w_buff0~0_484, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_187, ~y$flush_delayed~0=v_~y$flush_delayed~0_31, #length=|v_#length_17|, ULTIMATE.start_main_~#t1441~0.base=|v_ULTIMATE.start_main_~#t1441~0.base_35|, ~y~0=v_~y~0_135, ULTIMATE.start_main_~#t1442~0.offset=|v_ULTIMATE.start_main_~#t1442~0.offset_15|, ULTIMATE.start_main_~#t1442~0.base=|v_ULTIMATE.start_main_~#t1442~0.base_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_239, ~weak$$choice0~0=v_~weak$$choice0~0_20, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_102|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ~y$w_buff1~0=v_~y$w_buff1~0_286, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t1441~0.offset=|v_ULTIMATE.start_main_~#t1441~0.offset_27|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_135, #valid=|v_#valid_57|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_327, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_153, ~x~0=v_~x~0_98, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_445} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1441~0.base, ~y~0, ULTIMATE.start_main_~#t1442~0.offset, ULTIMATE.start_main_~#t1442~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t1441~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:19:32,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L4-->L736: Formula: (and (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-389628928)) (= 1 ~x~0_Out-389628928) (= ~y$r_buff0_thd1~0_In-389628928 ~y$r_buff1_thd1~0_Out-389628928) (= 1 ~y$r_buff0_thd1~0_Out-389628928) (= ~y$r_buff0_thd0~0_In-389628928 ~y$r_buff1_thd0~0_Out-389628928) (= ~y$r_buff1_thd2~0_Out-389628928 ~y$r_buff0_thd2~0_In-389628928)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-389628928, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-389628928, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-389628928, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-389628928} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-389628928, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-389628928, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-389628928, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-389628928, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-389628928, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-389628928, ~x~0=~x~0_Out-389628928, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-389628928} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:19:32,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L792-1-->L794: Formula: (and (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1442~0.base_11|)) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1442~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1442~0.base_11|) |v_ULTIMATE.start_main_~#t1442~0.offset_10| 1)) |v_#memory_int_7|) (= |v_ULTIMATE.start_main_~#t1442~0.offset_10| 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1442~0.base_11| 4) |v_#length_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1442~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1442~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1442~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1442~0.offset=|v_ULTIMATE.start_main_~#t1442~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, ULTIMATE.start_main_~#t1442~0.base=|v_ULTIMATE.start_main_~#t1442~0.base_11|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1442~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1442~0.base, #length] because there is no mapped edge [2019-11-28 18:19:32,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L737-->L737-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1026067028 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1026067028 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1026067028| ~y$w_buff0_used~0_In-1026067028) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1026067028| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1026067028, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1026067028} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1026067028|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1026067028, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1026067028} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:19:32,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L758-->L758-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-620568216 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out-620568216| ~y$w_buff0~0_In-620568216) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In-620568216| |P1Thread1of1ForFork1_#t~ite14_Out-620568216|)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out-620568216| ~y$w_buff0~0_In-620568216) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-620568216 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-620568216 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-620568216 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-620568216 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite14_Out-620568216| |P1Thread1of1ForFork1_#t~ite15_Out-620568216|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-620568216, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-620568216, ~y$w_buff0~0=~y$w_buff0~0_In-620568216, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-620568216, ~weak$$choice2~0=~weak$$choice2~0_In-620568216, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-620568216|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-620568216} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-620568216, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-620568216, ~y$w_buff0~0=~y$w_buff0~0_In-620568216, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-620568216, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-620568216|, ~weak$$choice2~0=~weak$$choice2~0_In-620568216, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-620568216|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-620568216} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:19:32,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L760-->L760-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1563107477 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_Out1563107477| ~y$w_buff0_used~0_In1563107477) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1563107477 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In1563107477 256) 0) .cse0) (= 0 (mod ~y$w_buff0_used~0_In1563107477 256)) (and .cse0 (= (mod ~y$r_buff1_thd2~0_In1563107477 256) 0)))) .cse1 (= |P1Thread1of1ForFork1_#t~ite20_Out1563107477| |P1Thread1of1ForFork1_#t~ite21_Out1563107477|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite21_Out1563107477| ~y$w_buff0_used~0_In1563107477) (= |P1Thread1of1ForFork1_#t~ite20_In1563107477| |P1Thread1of1ForFork1_#t~ite20_Out1563107477|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1563107477, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1563107477, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1563107477|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1563107477, ~weak$$choice2~0=~weak$$choice2~0_In1563107477, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1563107477} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1563107477, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1563107477, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1563107477|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1563107477, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1563107477|, ~weak$$choice2~0=~weak$$choice2~0_In1563107477, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1563107477} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:19:32,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L762-->L763: Formula: (and (not (= (mod v_~weak$$choice2~0_18 256) 0)) (= v_~y$r_buff0_thd2~0_68 v_~y$r_buff0_thd2~0_67)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_67, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_5|, ~weak$$choice2~0=v_~weak$$choice2~0_18, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_11|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_5|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:19:32,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1245840492 256) 0))) (or (and (not .cse0) (= ~y$r_buff1_thd2~0_In-1245840492 |P1Thread1of1ForFork1_#t~ite30_Out-1245840492|) (= |P1Thread1of1ForFork1_#t~ite29_In-1245840492| |P1Thread1of1ForFork1_#t~ite29_Out-1245840492|)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-1245840492| |P1Thread1of1ForFork1_#t~ite30_Out-1245840492|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1245840492 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-1245840492 256)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1245840492 256) 0)) (and (= (mod ~y$w_buff1_used~0_In-1245840492 256) 0) .cse1))) (= |P1Thread1of1ForFork1_#t~ite29_Out-1245840492| ~y$r_buff1_thd2~0_In-1245840492)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1245840492, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1245840492|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1245840492, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1245840492, ~weak$$choice2~0=~weak$$choice2~0_In-1245840492, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1245840492} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1245840492, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1245840492|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1245840492|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1245840492, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1245840492, ~weak$$choice2~0=~weak$$choice2~0_In-1245840492, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1245840492} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:19:32,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L765-->L769: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= v_~y~0_24 v_~y$mem_tmp~0_6) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_9} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~y~0=v_~y~0_24} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-11-28 18:19:32,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L769-2-->L769-5: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In139294938 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out139294938| |P1Thread1of1ForFork1_#t~ite32_Out139294938|)) (.cse0 (= (mod ~y$w_buff1_used~0_In139294938 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= ~y~0_In139294938 |P1Thread1of1ForFork1_#t~ite32_Out139294938|)) (and (not .cse1) (= ~y$w_buff1~0_In139294938 |P1Thread1of1ForFork1_#t~ite32_Out139294938|) .cse2 (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In139294938, ~y$w_buff1~0=~y$w_buff1~0_In139294938, ~y~0=~y~0_In139294938, ~y$w_buff1_used~0=~y$w_buff1_used~0_In139294938} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In139294938, ~y$w_buff1~0=~y$w_buff1~0_In139294938, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out139294938|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out139294938|, ~y~0=~y~0_In139294938, ~y$w_buff1_used~0=~y$w_buff1_used~0_In139294938} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-11-28 18:19:32,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L770-->L770-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In942579292 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In942579292 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out942579292| ~y$w_buff0_used~0_In942579292)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out942579292| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In942579292, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In942579292} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In942579292, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In942579292, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out942579292|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:19:32,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L771-->L771-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In1399082591 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1399082591 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1399082591 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1399082591 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out1399082591| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite35_Out1399082591| ~y$w_buff1_used~0_In1399082591)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1399082591, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1399082591, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1399082591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1399082591} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1399082591, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1399082591, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1399082591, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1399082591|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1399082591} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:19:32,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In682646503 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In682646503 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out682646503|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In682646503 |P1Thread1of1ForFork1_#t~ite36_Out682646503|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In682646503, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In682646503} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In682646503, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In682646503, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out682646503|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:19:32,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L773-->L773-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In526668812 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In526668812 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In526668812 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In526668812 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In526668812 |P1Thread1of1ForFork1_#t~ite37_Out526668812|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out526668812|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In526668812, ~y$w_buff0_used~0=~y$w_buff0_used~0_In526668812, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In526668812, ~y$w_buff1_used~0=~y$w_buff1_used~0_In526668812} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In526668812, ~y$w_buff0_used~0=~y$w_buff0_used~0_In526668812, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In526668812, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out526668812|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In526668812} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:19:32,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd2~0_151 |v_P1Thread1of1ForFork1_#t~ite37_30|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_151, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_29|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:19:32,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L738-->L738-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In100990073 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In100990073 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In100990073 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In100990073 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out100990073| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite6_Out100990073| ~y$w_buff1_used~0_In100990073)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In100990073, ~y$w_buff0_used~0=~y$w_buff0_used~0_In100990073, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In100990073, ~y$w_buff1_used~0=~y$w_buff1_used~0_In100990073} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out100990073|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In100990073, ~y$w_buff0_used~0=~y$w_buff0_used~0_In100990073, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In100990073, ~y$w_buff1_used~0=~y$w_buff1_used~0_In100990073} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:19:32,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L739-->L740: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1933299659 256))) (.cse0 (= ~y$r_buff0_thd1~0_In-1933299659 ~y$r_buff0_thd1~0_Out-1933299659)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1933299659 256) 0))) (or (and .cse0 .cse1) (and (= 0 ~y$r_buff0_thd1~0_Out-1933299659) (not .cse1) (not .cse2)) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1933299659, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1933299659} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1933299659, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1933299659|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1933299659} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:19:32,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In236354802 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In236354802 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd1~0_In236354802 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In236354802 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out236354802| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out236354802| ~y$r_buff1_thd1~0_In236354802)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In236354802, ~y$w_buff0_used~0=~y$w_buff0_used~0_In236354802, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In236354802, ~y$w_buff1_used~0=~y$w_buff1_used~0_In236354802} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In236354802, ~y$w_buff0_used~0=~y$w_buff0_used~0_In236354802, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out236354802|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In236354802, ~y$w_buff1_used~0=~y$w_buff1_used~0_In236354802} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:19:32,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L740-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~y$r_buff1_thd1~0_50 |v_P0Thread1of1ForFork0_#t~ite8_26|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_50, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:19:32,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L798-->L800-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$w_buff0_used~0_276 256)) (= (mod v_~y$r_buff0_thd0~0_50 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:19:32,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L800-2-->L800-5: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1965999018 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1965999018 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite41_Out1965999018| |ULTIMATE.start_main_#t~ite40_Out1965999018|))) (or (and (or .cse0 .cse1) (= ~y~0_In1965999018 |ULTIMATE.start_main_#t~ite40_Out1965999018|) .cse2) (and (= |ULTIMATE.start_main_#t~ite40_Out1965999018| ~y$w_buff1~0_In1965999018) (not .cse0) (not .cse1) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1965999018, ~y~0=~y~0_In1965999018, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1965999018, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1965999018} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1965999018|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1965999018|, ~y$w_buff1~0=~y$w_buff1~0_In1965999018, ~y~0=~y~0_In1965999018, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1965999018, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1965999018} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:19:32,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-249842817 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-249842817 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-249842817 |ULTIMATE.start_main_#t~ite42_Out-249842817|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out-249842817|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-249842817, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-249842817} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-249842817, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-249842817, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-249842817|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:19:32,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L802-->L802-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In1038574903 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In1038574903 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1038574903 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1038574903 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out1038574903| ~y$w_buff1_used~0_In1038574903)) (and (= |ULTIMATE.start_main_#t~ite43_Out1038574903| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1038574903, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1038574903, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1038574903, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1038574903} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1038574903, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1038574903, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1038574903|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1038574903, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1038574903} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:19:32,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In2122294837 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2122294837 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out2122294837| 0)) (and (= |ULTIMATE.start_main_#t~ite44_Out2122294837| ~y$r_buff0_thd0~0_In2122294837) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2122294837, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2122294837} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2122294837, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2122294837, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out2122294837|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:19:32,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L804-->L804-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1228303807 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1228303807 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1228303807 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1228303807 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out1228303807|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite45_Out1228303807| ~y$r_buff1_thd0~0_In1228303807)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1228303807, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1228303807, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1228303807, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1228303807} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1228303807, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1228303807, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1228303807, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1228303807|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1228303807} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:19:32,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L804-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~main$tmp_guard1~0_16 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_18) (= v_~x~0_61 2))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~y$r_buff1_thd0~0_104 |v_ULTIMATE.start_main_#t~ite45_33|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~x~0=v_~x~0_61, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_33|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x~0=v_~x~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_104, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_32|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:19:32,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:19:32 BasicIcfg [2019-11-28 18:19:32,757 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:19:32,757 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:19:32,757 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:19:32,758 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:19:32,758 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:19:18" (3/4) ... [2019-11-28 18:19:32,762 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:19:32,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] ULTIMATE.startENTRY-->L792: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff1_thd2~0_239) (= 0 v_~y$flush_delayed~0_31) (= v_~main$tmp_guard0~0_30 0) (= v_~x~0_98 0) (= v_~y~0_135 0) (= |v_#NULL.offset_3| 0) (= v_~y$mem_tmp~0_22 0) (= v_~y$r_buff1_thd1~0_110 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1441~0.base_35| 1) |v_#valid_57|) (= v_~y$r_buff0_thd1~0_187 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1441~0.base_35| 4)) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~y$w_buff0_used~0_704 0) (= v_~main$tmp_guard1~0_45 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1441~0.base_35|)) (= v_~y$r_buff0_thd0~0_135 0) (= v_~y$r_buff1_thd0~0_153 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_cnt~0_51) (< 0 |v_#StackHeapBarrier_14|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1441~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1441~0.base_35|) |v_ULTIMATE.start_main_~#t1441~0.offset_27| 0)) |v_#memory_int_15|) (= 0 v_~y$r_buff0_thd2~0_327) (= 0 v_~weak$$choice0~0_20) (= v_~y$w_buff1_used~0_445 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1441~0.base_35|) (= 0 |v_#NULL.base_3|) (= |v_ULTIMATE.start_main_~#t1441~0.offset_27| 0) (= v_~weak$$choice2~0_107 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$w_buff1~0_286 0) (= 0 v_~y$w_buff0~0_484))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{~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_704, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_39|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_78|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_47|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_110, ~y$mem_tmp~0=v_~y$mem_tmp~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~y$w_buff0~0=v_~y$w_buff0~0_484, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_187, ~y$flush_delayed~0=v_~y$flush_delayed~0_31, #length=|v_#length_17|, ULTIMATE.start_main_~#t1441~0.base=|v_ULTIMATE.start_main_~#t1441~0.base_35|, ~y~0=v_~y~0_135, ULTIMATE.start_main_~#t1442~0.offset=|v_ULTIMATE.start_main_~#t1442~0.offset_15|, ULTIMATE.start_main_~#t1442~0.base=|v_ULTIMATE.start_main_~#t1442~0.base_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_239, ~weak$$choice0~0=v_~weak$$choice0~0_20, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_102|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ~y$w_buff1~0=v_~y$w_buff1~0_286, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t1441~0.offset=|v_ULTIMATE.start_main_~#t1441~0.offset_27|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_135, #valid=|v_#valid_57|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_327, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_153, ~x~0=v_~x~0_98, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_445} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1441~0.base, ~y~0, ULTIMATE.start_main_~#t1442~0.offset, ULTIMATE.start_main_~#t1442~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t1441~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:19:32,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L4-->L736: Formula: (and (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-389628928)) (= 1 ~x~0_Out-389628928) (= ~y$r_buff0_thd1~0_In-389628928 ~y$r_buff1_thd1~0_Out-389628928) (= 1 ~y$r_buff0_thd1~0_Out-389628928) (= ~y$r_buff0_thd0~0_In-389628928 ~y$r_buff1_thd0~0_Out-389628928) (= ~y$r_buff1_thd2~0_Out-389628928 ~y$r_buff0_thd2~0_In-389628928)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-389628928, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-389628928, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-389628928, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-389628928} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-389628928, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-389628928, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-389628928, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-389628928, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-389628928, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-389628928, ~x~0=~x~0_Out-389628928, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-389628928} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:19:32,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L792-1-->L794: Formula: (and (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1442~0.base_11|)) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1442~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1442~0.base_11|) |v_ULTIMATE.start_main_~#t1442~0.offset_10| 1)) |v_#memory_int_7|) (= |v_ULTIMATE.start_main_~#t1442~0.offset_10| 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1442~0.base_11| 4) |v_#length_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1442~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1442~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1442~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1442~0.offset=|v_ULTIMATE.start_main_~#t1442~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, ULTIMATE.start_main_~#t1442~0.base=|v_ULTIMATE.start_main_~#t1442~0.base_11|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1442~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1442~0.base, #length] because there is no mapped edge [2019-11-28 18:19:32,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L737-->L737-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1026067028 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1026067028 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1026067028| ~y$w_buff0_used~0_In-1026067028) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1026067028| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1026067028, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1026067028} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1026067028|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1026067028, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1026067028} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:19:32,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L758-->L758-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-620568216 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out-620568216| ~y$w_buff0~0_In-620568216) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In-620568216| |P1Thread1of1ForFork1_#t~ite14_Out-620568216|)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out-620568216| ~y$w_buff0~0_In-620568216) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-620568216 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-620568216 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-620568216 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-620568216 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite14_Out-620568216| |P1Thread1of1ForFork1_#t~ite15_Out-620568216|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-620568216, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-620568216, ~y$w_buff0~0=~y$w_buff0~0_In-620568216, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-620568216, ~weak$$choice2~0=~weak$$choice2~0_In-620568216, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-620568216|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-620568216} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-620568216, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-620568216, ~y$w_buff0~0=~y$w_buff0~0_In-620568216, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-620568216, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-620568216|, ~weak$$choice2~0=~weak$$choice2~0_In-620568216, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-620568216|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-620568216} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:19:32,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L760-->L760-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1563107477 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_Out1563107477| ~y$w_buff0_used~0_In1563107477) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1563107477 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In1563107477 256) 0) .cse0) (= 0 (mod ~y$w_buff0_used~0_In1563107477 256)) (and .cse0 (= (mod ~y$r_buff1_thd2~0_In1563107477 256) 0)))) .cse1 (= |P1Thread1of1ForFork1_#t~ite20_Out1563107477| |P1Thread1of1ForFork1_#t~ite21_Out1563107477|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite21_Out1563107477| ~y$w_buff0_used~0_In1563107477) (= |P1Thread1of1ForFork1_#t~ite20_In1563107477| |P1Thread1of1ForFork1_#t~ite20_Out1563107477|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1563107477, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1563107477, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1563107477|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1563107477, ~weak$$choice2~0=~weak$$choice2~0_In1563107477, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1563107477} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1563107477, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1563107477, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1563107477|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1563107477, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1563107477|, ~weak$$choice2~0=~weak$$choice2~0_In1563107477, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1563107477} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:19:32,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L762-->L763: Formula: (and (not (= (mod v_~weak$$choice2~0_18 256) 0)) (= v_~y$r_buff0_thd2~0_68 v_~y$r_buff0_thd2~0_67)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_67, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_5|, ~weak$$choice2~0=v_~weak$$choice2~0_18, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_11|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_5|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:19:32,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1245840492 256) 0))) (or (and (not .cse0) (= ~y$r_buff1_thd2~0_In-1245840492 |P1Thread1of1ForFork1_#t~ite30_Out-1245840492|) (= |P1Thread1of1ForFork1_#t~ite29_In-1245840492| |P1Thread1of1ForFork1_#t~ite29_Out-1245840492|)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-1245840492| |P1Thread1of1ForFork1_#t~ite30_Out-1245840492|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1245840492 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-1245840492 256)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1245840492 256) 0)) (and (= (mod ~y$w_buff1_used~0_In-1245840492 256) 0) .cse1))) (= |P1Thread1of1ForFork1_#t~ite29_Out-1245840492| ~y$r_buff1_thd2~0_In-1245840492)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1245840492, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1245840492|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1245840492, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1245840492, ~weak$$choice2~0=~weak$$choice2~0_In-1245840492, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1245840492} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1245840492, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1245840492|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1245840492|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1245840492, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1245840492, ~weak$$choice2~0=~weak$$choice2~0_In-1245840492, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1245840492} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:19:32,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L765-->L769: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= v_~y~0_24 v_~y$mem_tmp~0_6) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_9} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~y~0=v_~y~0_24} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-11-28 18:19:32,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L769-2-->L769-5: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In139294938 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out139294938| |P1Thread1of1ForFork1_#t~ite32_Out139294938|)) (.cse0 (= (mod ~y$w_buff1_used~0_In139294938 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= ~y~0_In139294938 |P1Thread1of1ForFork1_#t~ite32_Out139294938|)) (and (not .cse1) (= ~y$w_buff1~0_In139294938 |P1Thread1of1ForFork1_#t~ite32_Out139294938|) .cse2 (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In139294938, ~y$w_buff1~0=~y$w_buff1~0_In139294938, ~y~0=~y~0_In139294938, ~y$w_buff1_used~0=~y$w_buff1_used~0_In139294938} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In139294938, ~y$w_buff1~0=~y$w_buff1~0_In139294938, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out139294938|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out139294938|, ~y~0=~y~0_In139294938, ~y$w_buff1_used~0=~y$w_buff1_used~0_In139294938} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-11-28 18:19:32,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L770-->L770-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In942579292 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In942579292 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out942579292| ~y$w_buff0_used~0_In942579292)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out942579292| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In942579292, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In942579292} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In942579292, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In942579292, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out942579292|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:19:32,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L771-->L771-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In1399082591 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1399082591 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1399082591 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1399082591 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out1399082591| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite35_Out1399082591| ~y$w_buff1_used~0_In1399082591)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1399082591, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1399082591, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1399082591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1399082591} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1399082591, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1399082591, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1399082591, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1399082591|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1399082591} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:19:32,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In682646503 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In682646503 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out682646503|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In682646503 |P1Thread1of1ForFork1_#t~ite36_Out682646503|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In682646503, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In682646503} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In682646503, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In682646503, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out682646503|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:19:32,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L773-->L773-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In526668812 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In526668812 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In526668812 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In526668812 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In526668812 |P1Thread1of1ForFork1_#t~ite37_Out526668812|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out526668812|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In526668812, ~y$w_buff0_used~0=~y$w_buff0_used~0_In526668812, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In526668812, ~y$w_buff1_used~0=~y$w_buff1_used~0_In526668812} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In526668812, ~y$w_buff0_used~0=~y$w_buff0_used~0_In526668812, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In526668812, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out526668812|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In526668812} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:19:32,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd2~0_151 |v_P1Thread1of1ForFork1_#t~ite37_30|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_151, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_29|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:19:32,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L738-->L738-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In100990073 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In100990073 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In100990073 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In100990073 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out100990073| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite6_Out100990073| ~y$w_buff1_used~0_In100990073)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In100990073, ~y$w_buff0_used~0=~y$w_buff0_used~0_In100990073, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In100990073, ~y$w_buff1_used~0=~y$w_buff1_used~0_In100990073} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out100990073|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In100990073, ~y$w_buff0_used~0=~y$w_buff0_used~0_In100990073, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In100990073, ~y$w_buff1_used~0=~y$w_buff1_used~0_In100990073} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:19:32,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L739-->L740: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1933299659 256))) (.cse0 (= ~y$r_buff0_thd1~0_In-1933299659 ~y$r_buff0_thd1~0_Out-1933299659)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1933299659 256) 0))) (or (and .cse0 .cse1) (and (= 0 ~y$r_buff0_thd1~0_Out-1933299659) (not .cse1) (not .cse2)) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1933299659, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1933299659} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1933299659, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1933299659|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1933299659} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:19:32,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In236354802 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In236354802 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd1~0_In236354802 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In236354802 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out236354802| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out236354802| ~y$r_buff1_thd1~0_In236354802)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In236354802, ~y$w_buff0_used~0=~y$w_buff0_used~0_In236354802, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In236354802, ~y$w_buff1_used~0=~y$w_buff1_used~0_In236354802} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In236354802, ~y$w_buff0_used~0=~y$w_buff0_used~0_In236354802, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out236354802|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In236354802, ~y$w_buff1_used~0=~y$w_buff1_used~0_In236354802} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:19:32,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L740-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~y$r_buff1_thd1~0_50 |v_P0Thread1of1ForFork0_#t~ite8_26|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_50, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:19:32,780 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L798-->L800-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$w_buff0_used~0_276 256)) (= (mod v_~y$r_buff0_thd0~0_50 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:19:32,780 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L800-2-->L800-5: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1965999018 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1965999018 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite41_Out1965999018| |ULTIMATE.start_main_#t~ite40_Out1965999018|))) (or (and (or .cse0 .cse1) (= ~y~0_In1965999018 |ULTIMATE.start_main_#t~ite40_Out1965999018|) .cse2) (and (= |ULTIMATE.start_main_#t~ite40_Out1965999018| ~y$w_buff1~0_In1965999018) (not .cse0) (not .cse1) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1965999018, ~y~0=~y~0_In1965999018, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1965999018, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1965999018} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1965999018|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1965999018|, ~y$w_buff1~0=~y$w_buff1~0_In1965999018, ~y~0=~y~0_In1965999018, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1965999018, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1965999018} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:19:32,782 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-249842817 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-249842817 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-249842817 |ULTIMATE.start_main_#t~ite42_Out-249842817|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out-249842817|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-249842817, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-249842817} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-249842817, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-249842817, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-249842817|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:19:32,783 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L802-->L802-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In1038574903 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In1038574903 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1038574903 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1038574903 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out1038574903| ~y$w_buff1_used~0_In1038574903)) (and (= |ULTIMATE.start_main_#t~ite43_Out1038574903| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1038574903, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1038574903, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1038574903, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1038574903} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1038574903, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1038574903, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1038574903|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1038574903, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1038574903} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:19:32,783 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In2122294837 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2122294837 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out2122294837| 0)) (and (= |ULTIMATE.start_main_#t~ite44_Out2122294837| ~y$r_buff0_thd0~0_In2122294837) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2122294837, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2122294837} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2122294837, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2122294837, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out2122294837|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:19:32,784 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L804-->L804-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1228303807 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1228303807 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1228303807 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1228303807 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out1228303807|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite45_Out1228303807| ~y$r_buff1_thd0~0_In1228303807)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1228303807, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1228303807, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1228303807, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1228303807} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1228303807, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1228303807, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1228303807, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1228303807|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1228303807} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:19:32,784 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L804-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~main$tmp_guard1~0_16 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_18) (= v_~x~0_61 2))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~y$r_buff1_thd0~0_104 |v_ULTIMATE.start_main_#t~ite45_33|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~x~0=v_~x~0_61, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_33|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x~0=v_~x~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_104, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_32|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:19:32,917 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:19:32,917 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:19:32,921 INFO L168 Benchmark]: Toolchain (without parser) took 16358.72 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 490.2 MB). Free memory was 957.7 MB in the beginning and 1.2 GB in the end (delta: -228.8 MB). Peak memory consumption was 261.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:19:32,923 INFO L168 Benchmark]: CDTParser took 0.85 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:19:32,926 INFO L168 Benchmark]: CACSL2BoogieTranslator took 758.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -146.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:19:32,927 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.02 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:19:32,927 INFO L168 Benchmark]: Boogie Preprocessor took 44.03 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:19:32,928 INFO L168 Benchmark]: RCFGBuilder took 797.21 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: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:19:32,928 INFO L168 Benchmark]: TraceAbstraction took 14534.92 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 354.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -144.6 MB). Peak memory consumption was 210.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:19:32,929 INFO L168 Benchmark]: Witness Printer took 160.25 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:19:32,931 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.85 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 758.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -146.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.02 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.03 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 797.21 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: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14534.92 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 354.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -144.6 MB). Peak memory consumption was 210.3 MB. Max. memory is 11.5 GB. * Witness Printer took 160.25 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 146 ProgramPointsBefore, 75 ProgramPointsAfterwards, 180 TransitionsBefore, 85 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 28 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 27 ChoiceCompositions, 4902 VarBasedMoverChecksPositive, 321 VarBasedMoverChecksNegative, 236 SemBasedMoverChecksPositive, 194 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 74785 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L792] FCALL, FORK 0 pthread_create(&t1441, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 1 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t1442, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 x = 2 [L753] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L758] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L796] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 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 [L803] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.2s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1639 SDtfs, 1597 SDslu, 3370 SDs, 0 SdLazy, 1717 SolverSat, 91 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16855occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 8679 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 391 NumberOfCodeBlocks, 391 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 326 ConstructedInterpolants, 0 QuantifiedInterpolants, 47951 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...