/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix048_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:47:19,175 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:47:19,179 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:47:19,197 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:47:19,197 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:47:19,199 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:47:19,201 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:47:19,211 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:47:19,215 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:47:19,218 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:47:19,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:47:19,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:47:19,222 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:47:19,224 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:47:19,226 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:47:19,228 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:47:19,229 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:47:19,231 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:47:19,232 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:47:19,238 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:47:19,243 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:47:19,248 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:47:19,250 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:47:19,251 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:47:19,253 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:47:19,253 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:47:19,253 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:47:19,255 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:47:19,257 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:47:19,258 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:47:19,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:47:19,259 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:47:19,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:47:19,261 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:47:19,262 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:47:19,262 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:47:19,263 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:47:19,263 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:47:19,263 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:47:19,264 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:47:19,265 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:47:19,266 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:47:19,304 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:47:19,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:47:19,309 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:47:19,309 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:47:19,310 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:47:19,310 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:47:19,310 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:47:19,310 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:47:19,310 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:47:19,311 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:47:19,311 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:47:19,311 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:47:19,311 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:47:19,311 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:47:19,312 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:47:19,312 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:47:19,312 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:47:19,312 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:47:19,312 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:47:19,312 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:47:19,313 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:47:19,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:47:19,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:47:19,314 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:47:19,314 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:47:19,314 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:47:19,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:47:19,315 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:47:19,315 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:47:19,315 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:47:19,621 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:47:19,633 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:47:19,637 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:47:19,638 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:47:19,639 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:47:19,639 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix048_pso.oepc.i [2019-12-26 22:47:19,708 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9937c648/73e0c6fc651f449fabba6f422f095680/FLAG748cda2b3 [2019-12-26 22:47:20,262 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:47:20,263 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix048_pso.oepc.i [2019-12-26 22:47:20,277 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9937c648/73e0c6fc651f449fabba6f422f095680/FLAG748cda2b3 [2019-12-26 22:47:20,539 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9937c648/73e0c6fc651f449fabba6f422f095680 [2019-12-26 22:47:20,549 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:47:20,552 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:47:20,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:47:20,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:47:20,557 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:47:20,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:47:20" (1/1) ... [2019-12-26 22:47:20,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@730866ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:20, skipping insertion in model container [2019-12-26 22:47:20,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:47:20" (1/1) ... [2019-12-26 22:47:20,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:47:20,636 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:47:21,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:47:21,169 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:47:21,286 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:47:21,358 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:47:21,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:21 WrapperNode [2019-12-26 22:47:21,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:47:21,359 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:47:21,359 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:47:21,359 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:47:21,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:21" (1/1) ... [2019-12-26 22:47:21,394 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:21" (1/1) ... [2019-12-26 22:47:21,431 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:47:21,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:47:21,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:47:21,432 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:47:21,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:21" (1/1) ... [2019-12-26 22:47:21,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:21" (1/1) ... [2019-12-26 22:47:21,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:21" (1/1) ... [2019-12-26 22:47:21,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:21" (1/1) ... [2019-12-26 22:47:21,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:21" (1/1) ... [2019-12-26 22:47:21,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:21" (1/1) ... [2019-12-26 22:47:21,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:21" (1/1) ... [2019-12-26 22:47:21,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:47:21,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:47:21,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:47:21,471 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:47:21,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:21" (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-12-26 22:47:21,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:47:21,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:47:21,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:47:21,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:47:21,537 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:47:21,537 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:47:21,537 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:47:21,537 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:47:21,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:47:21,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:47:21,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:47:21,540 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:47:22,255 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:47:22,255 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:47:22,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:47:22 BoogieIcfgContainer [2019-12-26 22:47:22,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:47:22,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:47:22,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:47:22,264 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:47:22,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:47:20" (1/3) ... [2019-12-26 22:47:22,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24034ff9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:47:22, skipping insertion in model container [2019-12-26 22:47:22,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:47:21" (2/3) ... [2019-12-26 22:47:22,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24034ff9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:47:22, skipping insertion in model container [2019-12-26 22:47:22,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:47:22" (3/3) ... [2019-12-26 22:47:22,271 INFO L109 eAbstractionObserver]: Analyzing ICFG mix048_pso.oepc.i [2019-12-26 22:47:22,285 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:47:22,285 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:47:22,297 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:47:22,298 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:47:22,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,335 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,335 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,335 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,335 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,336 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,348 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,348 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,382 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,382 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,382 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,389 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,413 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:47:22,430 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 22:47:22,451 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:47:22,451 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:47:22,451 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:47:22,452 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:47:22,452 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:47:22,452 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:47:22,452 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:47:22,452 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:47:22,469 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-26 22:47:22,471 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-26 22:47:22,561 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-26 22:47:22,561 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:47:22,576 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 22:47:22,596 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-26 22:47:22,643 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-26 22:47:22,643 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:47:22,649 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 22:47:22,664 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-26 22:47:22,665 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:47:27,487 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-26 22:47:27,594 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-26 22:47:27,684 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-12-26 22:47:27,685 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-26 22:47:27,689 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-26 22:47:28,134 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-12-26 22:47:28,136 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-12-26 22:47:28,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 22:47:28,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:28,144 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 22:47:28,144 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:47:28,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:28,151 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-12-26 22:47:28,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:28,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371288690] [2019-12-26 22:47:28,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:28,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:47:28,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371288690] [2019-12-26 22:47:28,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:28,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:47:28,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613010034] [2019-12-26 22:47:28,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:47:28,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:28,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:47:28,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:47:28,392 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-12-26 22:47:28,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:28,639 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-12-26 22:47:28,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:47:28,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 22:47:28,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:28,722 INFO L225 Difference]: With dead ends: 8074 [2019-12-26 22:47:28,722 INFO L226 Difference]: Without dead ends: 7606 [2019-12-26 22:47:28,724 INFO L631 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-12-26 22:47:28,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-12-26 22:47:29,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-12-26 22:47:29,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-12-26 22:47:29,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-12-26 22:47:29,134 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-12-26 22:47:29,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:29,135 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-12-26 22:47:29,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:47:29,135 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-12-26 22:47:29,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 22:47:29,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:29,141 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:47:29,142 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:47:29,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:29,142 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-12-26 22:47:29,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:29,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159673974] [2019-12-26 22:47:29,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:29,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:47:29,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159673974] [2019-12-26 22:47:29,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:29,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:47:29,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128110543] [2019-12-26 22:47:29,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:47:29,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:29,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:47:29,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:47:29,315 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-12-26 22:47:29,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:29,403 INFO L93 Difference]: Finished difference Result 1760 states and 4447 transitions. [2019-12-26 22:47:29,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:47:29,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 22:47:29,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:29,413 INFO L225 Difference]: With dead ends: 1760 [2019-12-26 22:47:29,413 INFO L226 Difference]: Without dead ends: 1292 [2019-12-26 22:47:29,417 INFO L631 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-12-26 22:47:29,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2019-12-26 22:47:29,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1292. [2019-12-26 22:47:29,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1292 states. [2019-12-26 22:47:29,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 2938 transitions. [2019-12-26 22:47:29,469 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 2938 transitions. Word has length 11 [2019-12-26 22:47:29,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:29,469 INFO L462 AbstractCegarLoop]: Abstraction has 1292 states and 2938 transitions. [2019-12-26 22:47:29,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:47:29,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 2938 transitions. [2019-12-26 22:47:29,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 22:47:29,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:29,479 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:47:29,479 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:47:29,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:29,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-12-26 22:47:29,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:29,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817406640] [2019-12-26 22:47:29,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:29,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:47:29,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817406640] [2019-12-26 22:47:29,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:29,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:47:29,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639029087] [2019-12-26 22:47:29,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:47:29,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:29,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:47:29,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:47:29,722 INFO L87 Difference]: Start difference. First operand 1292 states and 2938 transitions. Second operand 5 states. [2019-12-26 22:47:30,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:30,030 INFO L93 Difference]: Finished difference Result 1855 states and 4087 transitions. [2019-12-26 22:47:30,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:47:30,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-26 22:47:30,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:30,041 INFO L225 Difference]: With dead ends: 1855 [2019-12-26 22:47:30,041 INFO L226 Difference]: Without dead ends: 1854 [2019-12-26 22:47:30,042 INFO L631 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-12-26 22:47:30,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2019-12-26 22:47:30,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1547. [2019-12-26 22:47:30,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-12-26 22:47:30,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 3457 transitions. [2019-12-26 22:47:30,083 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 3457 transitions. Word has length 14 [2019-12-26 22:47:30,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:30,086 INFO L462 AbstractCegarLoop]: Abstraction has 1547 states and 3457 transitions. [2019-12-26 22:47:30,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:47:30,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 3457 transitions. [2019-12-26 22:47:30,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-26 22:47:30,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:30,089 INFO L411 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] [2019-12-26 22:47:30,089 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:47:30,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:30,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-12-26 22:47:30,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:30,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239515862] [2019-12-26 22:47:30,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:30,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:47:30,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239515862] [2019-12-26 22:47:30,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:30,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:47:30,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341980692] [2019-12-26 22:47:30,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:47:30,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:30,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:47:30,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:47:30,219 INFO L87 Difference]: Start difference. First operand 1547 states and 3457 transitions. Second operand 6 states. [2019-12-26 22:47:30,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:30,650 INFO L93 Difference]: Finished difference Result 2337 states and 5001 transitions. [2019-12-26 22:47:30,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 22:47:30,651 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-26 22:47:30,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:30,666 INFO L225 Difference]: With dead ends: 2337 [2019-12-26 22:47:30,667 INFO L226 Difference]: Without dead ends: 2285 [2019-12-26 22:47:30,667 INFO L631 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-12-26 22:47:30,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2285 states. [2019-12-26 22:47:30,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2285 to 1625. [2019-12-26 22:47:30,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1625 states. [2019-12-26 22:47:30,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 3604 transitions. [2019-12-26 22:47:30,711 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 3604 transitions. Word has length 24 [2019-12-26 22:47:30,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:30,711 INFO L462 AbstractCegarLoop]: Abstraction has 1625 states and 3604 transitions. [2019-12-26 22:47:30,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:47:30,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 3604 transitions. [2019-12-26 22:47:30,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 22:47:30,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:30,714 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:47:30,714 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:47:30,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:30,715 INFO L82 PathProgramCache]: Analyzing trace with hash 2063536940, now seen corresponding path program 1 times [2019-12-26 22:47:30,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:30,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999786078] [2019-12-26 22:47:30,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:30,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:47:30,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999786078] [2019-12-26 22:47:30,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:30,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:47:30,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862017151] [2019-12-26 22:47:30,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:47:30,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:30,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:47:30,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:47:30,805 INFO L87 Difference]: Start difference. First operand 1625 states and 3604 transitions. Second operand 5 states. [2019-12-26 22:47:31,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:31,274 INFO L93 Difference]: Finished difference Result 2383 states and 5182 transitions. [2019-12-26 22:47:31,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:47:31,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-26 22:47:31,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:31,289 INFO L225 Difference]: With dead ends: 2383 [2019-12-26 22:47:31,289 INFO L226 Difference]: Without dead ends: 2383 [2019-12-26 22:47:31,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:47:31,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2019-12-26 22:47:31,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2084. [2019-12-26 22:47:31,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2084 states. [2019-12-26 22:47:31,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 4594 transitions. [2019-12-26 22:47:31,337 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 4594 transitions. Word has length 26 [2019-12-26 22:47:31,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:31,337 INFO L462 AbstractCegarLoop]: Abstraction has 2084 states and 4594 transitions. [2019-12-26 22:47:31,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:47:31,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 4594 transitions. [2019-12-26 22:47:31,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 22:47:31,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:31,341 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:47:31,341 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:47:31,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:31,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1394338791, now seen corresponding path program 1 times [2019-12-26 22:47:31,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:31,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390124266] [2019-12-26 22:47:31,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:31,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:47:31,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390124266] [2019-12-26 22:47:31,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:31,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:47:31,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66794943] [2019-12-26 22:47:31,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:47:31,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:31,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:47:31,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:47:31,497 INFO L87 Difference]: Start difference. First operand 2084 states and 4594 transitions. Second operand 5 states. [2019-12-26 22:47:31,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:31,551 INFO L93 Difference]: Finished difference Result 1286 states and 2707 transitions. [2019-12-26 22:47:31,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:47:31,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-26 22:47:31,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:31,560 INFO L225 Difference]: With dead ends: 1286 [2019-12-26 22:47:31,560 INFO L226 Difference]: Without dead ends: 1165 [2019-12-26 22:47:31,561 INFO L631 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-12-26 22:47:31,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2019-12-26 22:47:31,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1076. [2019-12-26 22:47:31,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2019-12-26 22:47:31,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 2287 transitions. [2019-12-26 22:47:31,584 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 2287 transitions. Word has length 27 [2019-12-26 22:47:31,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:31,584 INFO L462 AbstractCegarLoop]: Abstraction has 1076 states and 2287 transitions. [2019-12-26 22:47:31,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:47:31,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 2287 transitions. [2019-12-26 22:47:31,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-26 22:47:31,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:31,588 INFO L411 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] [2019-12-26 22:47:31,588 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:47:31,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:31,588 INFO L82 PathProgramCache]: Analyzing trace with hash -44666522, now seen corresponding path program 1 times [2019-12-26 22:47:31,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:31,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103785071] [2019-12-26 22:47:31,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:31,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:47:31,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103785071] [2019-12-26 22:47:31,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:31,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:47:31,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116181268] [2019-12-26 22:47:31,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:47:31,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:31,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:47:31,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:47:31,664 INFO L87 Difference]: Start difference. First operand 1076 states and 2287 transitions. Second operand 4 states. [2019-12-26 22:47:31,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:31,688 INFO L93 Difference]: Finished difference Result 1807 states and 3865 transitions. [2019-12-26 22:47:31,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:47:31,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-26 22:47:31,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:31,692 INFO L225 Difference]: With dead ends: 1807 [2019-12-26 22:47:31,692 INFO L226 Difference]: Without dead ends: 800 [2019-12-26 22:47:31,692 INFO L631 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-12-26 22:47:31,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-12-26 22:47:31,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 800. [2019-12-26 22:47:31,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2019-12-26 22:47:31,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1708 transitions. [2019-12-26 22:47:31,708 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1708 transitions. Word has length 50 [2019-12-26 22:47:31,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:31,709 INFO L462 AbstractCegarLoop]: Abstraction has 800 states and 1708 transitions. [2019-12-26 22:47:31,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:47:31,709 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1708 transitions. [2019-12-26 22:47:31,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-26 22:47:31,711 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:31,711 INFO L411 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] [2019-12-26 22:47:31,712 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:47:31,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:31,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1290466760, now seen corresponding path program 2 times [2019-12-26 22:47:31,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:31,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72824803] [2019-12-26 22:47:31,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:31,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:31,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:47:31,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72824803] [2019-12-26 22:47:31,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:31,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:47:31,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393159599] [2019-12-26 22:47:31,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:47:31,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:31,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:47:31,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:47:31,832 INFO L87 Difference]: Start difference. First operand 800 states and 1708 transitions. Second operand 7 states. [2019-12-26 22:47:32,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:32,059 INFO L93 Difference]: Finished difference Result 1394 states and 2892 transitions. [2019-12-26 22:47:32,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 22:47:32,060 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-26 22:47:32,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:32,064 INFO L225 Difference]: With dead ends: 1394 [2019-12-26 22:47:32,064 INFO L226 Difference]: Without dead ends: 931 [2019-12-26 22:47:32,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:47:32,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2019-12-26 22:47:32,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 792. [2019-12-26 22:47:32,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2019-12-26 22:47:32,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1676 transitions. [2019-12-26 22:47:32,089 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1676 transitions. Word has length 50 [2019-12-26 22:47:32,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:32,089 INFO L462 AbstractCegarLoop]: Abstraction has 792 states and 1676 transitions. [2019-12-26 22:47:32,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:47:32,089 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1676 transitions. [2019-12-26 22:47:32,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-26 22:47:32,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:32,092 INFO L411 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] [2019-12-26 22:47:32,092 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:47:32,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:32,093 INFO L82 PathProgramCache]: Analyzing trace with hash 50774886, now seen corresponding path program 3 times [2019-12-26 22:47:32,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:32,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384611802] [2019-12-26 22:47:32,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:32,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:47:32,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384611802] [2019-12-26 22:47:32,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:32,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:47:32,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71726792] [2019-12-26 22:47:32,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:47:32,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:32,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:47:32,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:47:32,200 INFO L87 Difference]: Start difference. First operand 792 states and 1676 transitions. Second operand 3 states. [2019-12-26 22:47:32,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:32,253 INFO L93 Difference]: Finished difference Result 1051 states and 2216 transitions. [2019-12-26 22:47:32,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:47:32,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-26 22:47:32,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:32,256 INFO L225 Difference]: With dead ends: 1051 [2019-12-26 22:47:32,256 INFO L226 Difference]: Without dead ends: 1051 [2019-12-26 22:47:32,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:47:32,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2019-12-26 22:47:32,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 849. [2019-12-26 22:47:32,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2019-12-26 22:47:32,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1815 transitions. [2019-12-26 22:47:32,275 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1815 transitions. Word has length 50 [2019-12-26 22:47:32,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:32,275 INFO L462 AbstractCegarLoop]: Abstraction has 849 states and 1815 transitions. [2019-12-26 22:47:32,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:47:32,276 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1815 transitions. [2019-12-26 22:47:32,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 22:47:32,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:32,278 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:47:32,278 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:47:32,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:32,279 INFO L82 PathProgramCache]: Analyzing trace with hash 925752847, now seen corresponding path program 1 times [2019-12-26 22:47:32,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:32,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466200923] [2019-12-26 22:47:32,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:32,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:47:32,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466200923] [2019-12-26 22:47:32,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:32,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:47:32,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673177658] [2019-12-26 22:47:32,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:47:32,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:32,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:47:32,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:47:32,385 INFO L87 Difference]: Start difference. First operand 849 states and 1815 transitions. Second operand 6 states. [2019-12-26 22:47:32,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:32,851 INFO L93 Difference]: Finished difference Result 1004 states and 2107 transitions. [2019-12-26 22:47:32,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:47:32,852 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-26 22:47:32,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:32,854 INFO L225 Difference]: With dead ends: 1004 [2019-12-26 22:47:32,855 INFO L226 Difference]: Without dead ends: 1004 [2019-12-26 22:47:32,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:47:32,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2019-12-26 22:47:32,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 909. [2019-12-26 22:47:32,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-12-26 22:47:32,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1931 transitions. [2019-12-26 22:47:32,875 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1931 transitions. Word has length 51 [2019-12-26 22:47:32,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:32,875 INFO L462 AbstractCegarLoop]: Abstraction has 909 states and 1931 transitions. [2019-12-26 22:47:32,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:47:32,876 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1931 transitions. [2019-12-26 22:47:32,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 22:47:32,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:32,878 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:47:32,879 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:47:32,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:32,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1086861075, now seen corresponding path program 2 times [2019-12-26 22:47:32,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:32,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558090523] [2019-12-26 22:47:32,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:47:32,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:47:32,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558090523] [2019-12-26 22:47:32,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:47:32,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:47:32,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251153331] [2019-12-26 22:47:32,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:47:32,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:47:32,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:47:32,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:47:32,991 INFO L87 Difference]: Start difference. First operand 909 states and 1931 transitions. Second operand 3 states. [2019-12-26 22:47:33,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:47:33,004 INFO L93 Difference]: Finished difference Result 908 states and 1929 transitions. [2019-12-26 22:47:33,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:47:33,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-26 22:47:33,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:47:33,007 INFO L225 Difference]: With dead ends: 908 [2019-12-26 22:47:33,007 INFO L226 Difference]: Without dead ends: 908 [2019-12-26 22:47:33,007 INFO L631 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-12-26 22:47:33,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2019-12-26 22:47:33,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 754. [2019-12-26 22:47:33,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-12-26 22:47:33,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1638 transitions. [2019-12-26 22:47:33,028 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1638 transitions. Word has length 51 [2019-12-26 22:47:33,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:47:33,028 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1638 transitions. [2019-12-26 22:47:33,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:47:33,028 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1638 transitions. [2019-12-26 22:47:33,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 22:47:33,031 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:47:33,031 INFO L411 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-12-26 22:47:33,032 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:47:33,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:47:33,032 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 1 times [2019-12-26 22:47:33,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:47:33,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971139125] [2019-12-26 22:47:33,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:47:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:47:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:47:33,281 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:47:33,281 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:47:33,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= |v_ULTIMATE.start_main_~#t1285~0.offset_27| 0) (= 0 v_~__unbuffered_cnt~0_55) (= 0 v_~y$flush_delayed~0_22) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1285~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1285~0.base_40|) |v_ULTIMATE.start_main_~#t1285~0.offset_27| 0)) |v_#memory_int_17|) (= v_~y$r_buff1_thd0~0_125 0) (= 0 v_~y$r_buff0_thd2~0_324) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1285~0.base_40| 4)) (= 0 v_~__unbuffered_p1_EAX~0_51) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd2~0_235) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t1285~0.base_40| 1)) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$mem_tmp~0_15 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1285~0.base_40|) (= 0 v_~weak$$choice2~0_96) (= v_~y~0_133 0) (= 0 v_~__unbuffered_p0_EAX~0_91) (= v_~y$r_buff0_thd0~0_125 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1285~0.base_40|) 0) (= v_~y$w_buff1_used~0_311 0) (= v_~x~0_65 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_13) (= v_~y$r_buff1_thd1~0_115 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_18|, #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_632, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_76|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_22, #length=|v_#length_17|, ULTIMATE.start_main_~#t1286~0.base=|v_ULTIMATE.start_main_~#t1286~0.base_41|, ULTIMATE.start_main_~#t1286~0.offset=|v_ULTIMATE.start_main_~#t1286~0.offset_27|, ~y~0=v_~y~0_133, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ULTIMATE.start_main_~#t1285~0.offset=|v_ULTIMATE.start_main_~#t1285~0.offset_27|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ULTIMATE.start_main_~#t1285~0.base=|v_ULTIMATE.start_main_~#t1285~0.base_40|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_65|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~x~0=v_~x~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} 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_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1286~0.base, ULTIMATE.start_main_~#t1286~0.offset, ~y~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1285~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t1285~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #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-12-26 22:47:33,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1286~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1286~0.base_13|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1286~0.base_13|) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1286~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1286~0.base_13|) |v_ULTIMATE.start_main_~#t1286~0.offset_11| 1))) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1286~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t1286~0.offset_11|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1286~0.base_13| 4) |v_#length_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t1286~0.base=|v_ULTIMATE.start_main_~#t1286~0.base_13|, ULTIMATE.start_main_~#t1286~0.offset=|v_ULTIMATE.start_main_~#t1286~0.offset_11|, #length=|v_#length_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1286~0.base, ULTIMATE.start_main_~#t1286~0.offset, #length] because there is no mapped edge [2019-12-26 22:47:33,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~__unbuffered_p0_EAX~0_Out1117390222 ~x~0_In1117390222) (= ~y$r_buff1_thd2~0_Out1117390222 ~y$r_buff0_thd2~0_In1117390222) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1117390222 0)) (= ~y$r_buff0_thd1~0_Out1117390222 1) (= ~y$r_buff1_thd0~0_Out1117390222 ~y$r_buff0_thd0~0_In1117390222) (= ~y$r_buff0_thd1~0_In1117390222 ~y$r_buff1_thd1~0_Out1117390222)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1117390222, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1117390222, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1117390222, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1117390222, ~x~0=~x~0_In1117390222} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out1117390222, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out1117390222, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1117390222, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1117390222, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1117390222, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1117390222, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1117390222, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1117390222, ~x~0=~x~0_In1117390222} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-26 22:47:33,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1431609150 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1431609150 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1431609150| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out1431609150| ~y$w_buff0_used~0_In1431609150) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1431609150, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1431609150} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1431609150|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1431609150, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1431609150} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 22:47:33,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1199044273 256)))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1199044273 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-1199044273 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-1199044273 256) 0) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1199044273 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite21_Out-1199044273| |P1Thread1of1ForFork1_#t~ite20_Out-1199044273|) (= |P1Thread1of1ForFork1_#t~ite20_Out-1199044273| ~y$w_buff0_used~0_In-1199044273)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In-1199044273| |P1Thread1of1ForFork1_#t~ite20_Out-1199044273|) (= |P1Thread1of1ForFork1_#t~ite21_Out-1199044273| ~y$w_buff0_used~0_In-1199044273)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1199044273, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1199044273, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1199044273|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1199044273, ~weak$$choice2~0=~weak$$choice2~0_In-1199044273, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1199044273} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1199044273, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1199044273, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1199044273|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1199044273, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1199044273|, ~weak$$choice2~0=~weak$$choice2~0_In-1199044273, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1199044273} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-26 22:47:33,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse4 (= 0 (mod ~y$w_buff0_used~0_In1609714286 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In1609714286 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd2~0_In1609714286 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1609714286 256))) (.cse5 (= |P1Thread1of1ForFork1_#t~ite23_Out1609714286| |P1Thread1of1ForFork1_#t~ite24_Out1609714286|)) (.cse2 (= (mod ~weak$$choice2~0_In1609714286 256) 0))) (or (let ((.cse0 (not .cse6))) (and (or .cse0 (not .cse1)) .cse2 (= |P1Thread1of1ForFork1_#t~ite22_Out1609714286| |P1Thread1of1ForFork1_#t~ite23_Out1609714286|) (or .cse0 (not .cse3)) (not .cse4) .cse5 (= |P1Thread1of1ForFork1_#t~ite22_Out1609714286| 0))) (and (or (and .cse2 (or .cse4 (and .cse6 .cse3) (and .cse6 .cse1)) .cse5 (= ~y$w_buff1_used~0_In1609714286 |P1Thread1of1ForFork1_#t~ite23_Out1609714286|)) (and (= |P1Thread1of1ForFork1_#t~ite23_Out1609714286| |P1Thread1of1ForFork1_#t~ite23_In1609714286|) (not .cse2) (= ~y$w_buff1_used~0_In1609714286 |P1Thread1of1ForFork1_#t~ite24_Out1609714286|))) (= |P1Thread1of1ForFork1_#t~ite22_In1609714286| |P1Thread1of1ForFork1_#t~ite22_Out1609714286|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1609714286, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1609714286, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1609714286, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1609714286|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In1609714286|, ~weak$$choice2~0=~weak$$choice2~0_In1609714286, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1609714286} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1609714286, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1609714286, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1609714286, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1609714286|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1609714286|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out1609714286|, ~weak$$choice2~0=~weak$$choice2~0_In1609714286, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1609714286} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-26 22:47:33,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd1~0_In-794418723 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-794418723 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In-794418723 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-794418723 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-794418723 |P0Thread1of1ForFork0_#t~ite6_Out-794418723|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-794418723|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-794418723, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-794418723, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-794418723, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-794418723} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-794418723|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-794418723, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-794418723, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-794418723, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-794418723} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 22:47:33,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-112326392 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-112326392 256)))) (or (and (not .cse0) (= ~y$r_buff0_thd1~0_Out-112326392 0) (not .cse1)) (and (= ~y$r_buff0_thd1~0_Out-112326392 ~y$r_buff0_thd1~0_In-112326392) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-112326392, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-112326392} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-112326392, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-112326392|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-112326392} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:47:33,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd1~0_In1506289016 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1506289016 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1506289016 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1506289016 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1506289016|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd1~0_In1506289016 |P0Thread1of1ForFork0_#t~ite8_Out1506289016|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1506289016, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1506289016, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1506289016, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1506289016} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1506289016, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1506289016, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1506289016|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1506289016, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1506289016} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 22:47:33,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_29|) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310) (not (= (mod v_~weak$$choice2~0_88 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_29|, ~weak$$choice2~0=v_~weak$$choice2~0_88} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_28|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_28|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_24|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_29|, ~weak$$choice2~0=v_~weak$$choice2~0_88, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_31|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_34|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 22:47:33,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-162744933 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-162744933 256) 0))) (or (and .cse0 (= (mod ~y$w_buff1_used~0_In-162744933 256) 0)) (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-162744933 256))) (= 0 (mod ~y$w_buff0_used~0_In-162744933 256)))) (= |P1Thread1of1ForFork1_#t~ite30_Out-162744933| |P1Thread1of1ForFork1_#t~ite29_Out-162744933|) .cse1 (= ~y$r_buff1_thd2~0_In-162744933 |P1Thread1of1ForFork1_#t~ite29_Out-162744933|)) (and (= ~y$r_buff1_thd2~0_In-162744933 |P1Thread1of1ForFork1_#t~ite30_Out-162744933|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite29_In-162744933| |P1Thread1of1ForFork1_#t~ite29_Out-162744933|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-162744933, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-162744933|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-162744933, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-162744933, ~weak$$choice2~0=~weak$$choice2~0_In-162744933, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-162744933} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-162744933, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-162744933|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-162744933|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-162744933, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-162744933, ~weak$$choice2~0=~weak$$choice2~0_In-162744933, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-162744933} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-26 22:47:33,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-26 22:47:33,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-829970689 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-829970689 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out-829970689| ~y~0_In-829970689)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out-829970689| ~y$w_buff1~0_In-829970689) (not .cse1) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-829970689, ~y$w_buff1~0=~y$w_buff1~0_In-829970689, ~y~0=~y~0_In-829970689, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-829970689} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-829970689, ~y$w_buff1~0=~y$w_buff1~0_In-829970689, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-829970689|, ~y~0=~y~0_In-829970689, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-829970689} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-26 22:47:33,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_10|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_10|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_9|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_13|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-26 22:47:33,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-335258707 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-335258707 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-335258707| ~y$w_buff0_used~0_In-335258707)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-335258707|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-335258707, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-335258707} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-335258707, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-335258707, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-335258707|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-26 22:47:33,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In2132960239 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In2132960239 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In2132960239 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In2132960239 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite35_Out2132960239| ~y$w_buff1_used~0_In2132960239) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out2132960239| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2132960239, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2132960239, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2132960239, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2132960239} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2132960239, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2132960239, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2132960239, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out2132960239|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2132960239} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-26 22:47:33,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-723450394 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-723450394 256) 0))) (or (and (= ~y$r_buff0_thd2~0_In-723450394 |P1Thread1of1ForFork1_#t~ite36_Out-723450394|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-723450394|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-723450394, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-723450394} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-723450394, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-723450394, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-723450394|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-26 22:47:33,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In-58202726 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-58202726 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-58202726 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-58202726 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-58202726 |P1Thread1of1ForFork1_#t~ite37_Out-58202726|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-58202726|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-58202726, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-58202726, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-58202726, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-58202726} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-58202726, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-58202726, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-58202726, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-58202726|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-58202726} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 22:47:33,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} 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-12-26 22:47:33,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} 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-12-26 22:47:33,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 22:47:33,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-1936598451 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1936598451 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-1936598451| ~y~0_In-1936598451) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-1936598451| ~y$w_buff1~0_In-1936598451) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1936598451, ~y~0=~y~0_In-1936598451, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1936598451, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1936598451} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1936598451|, ~y$w_buff1~0=~y$w_buff1~0_In-1936598451, ~y~0=~y~0_In-1936598451, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1936598451, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1936598451} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-26 22:47:33,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-26 22:47:33,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-924998831 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-924998831 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-924998831 |ULTIMATE.start_main_#t~ite42_Out-924998831|)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-924998831|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-924998831, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-924998831} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-924998831, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-924998831, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-924998831|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 22:47:33,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1799939448 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1799939448 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In1799939448 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1799939448 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out1799939448|)) (and (or .cse1 .cse0) (= ~y$w_buff1_used~0_In1799939448 |ULTIMATE.start_main_#t~ite43_Out1799939448|) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1799939448, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1799939448, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1799939448, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1799939448} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1799939448, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1799939448, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1799939448|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1799939448, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1799939448} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-26 22:47:33,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In439247561 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In439247561 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out439247561|)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In439247561 |ULTIMATE.start_main_#t~ite44_Out439247561|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In439247561, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In439247561} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In439247561, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In439247561, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out439247561|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 22:47:33,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1222862791 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1222862791 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1222862791 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1222862791 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1222862791| ~y$r_buff1_thd0~0_In1222862791) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite45_Out1222862791| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1222862791, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1222862791, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1222862791, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1222862791} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1222862791, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1222862791, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1222862791, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1222862791|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1222862791} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 22:47:33,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~main$tmp_guard1~0_13 0) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 0 v_~__unbuffered_p1_EAX~0_19) (= 0 v_~__unbuffered_p0_EAX~0_47)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} 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-12-26 22:47:33,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:47:33 BasicIcfg [2019-12-26 22:47:33,387 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:47:33,389 INFO L168 Benchmark]: Toolchain (without parser) took 12837.99 ms. Allocated memory was 143.7 MB in the beginning and 406.3 MB in the end (delta: 262.7 MB). Free memory was 100.4 MB in the beginning and 296.2 MB in the end (delta: -195.9 MB). Peak memory consumption was 66.8 MB. Max. memory is 7.1 GB. [2019-12-26 22:47:33,390 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 22:47:33,391 INFO L168 Benchmark]: CACSL2BoogieTranslator took 805.70 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 100.0 MB in the beginning and 155.9 MB in the end (delta: -55.9 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-26 22:47:33,392 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.42 ms. Allocated memory is still 201.3 MB. Free memory was 155.9 MB in the beginning and 153.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 22:47:33,392 INFO L168 Benchmark]: Boogie Preprocessor took 38.85 ms. Allocated memory is still 201.3 MB. Free memory was 153.1 MB in the beginning and 151.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-26 22:47:33,393 INFO L168 Benchmark]: RCFGBuilder took 786.03 ms. Allocated memory is still 201.3 MB. Free memory was 151.0 MB in the beginning and 106.7 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2019-12-26 22:47:33,394 INFO L168 Benchmark]: TraceAbstraction took 11127.20 ms. Allocated memory was 201.3 MB in the beginning and 406.3 MB in the end (delta: 205.0 MB). Free memory was 106.1 MB in the beginning and 296.2 MB in the end (delta: -190.2 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2019-12-26 22:47:33,398 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.21 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 805.70 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 100.0 MB in the beginning and 155.9 MB in the end (delta: -55.9 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.42 ms. Allocated memory is still 201.3 MB. Free memory was 155.9 MB in the beginning and 153.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.85 ms. Allocated memory is still 201.3 MB. Free memory was 153.1 MB in the beginning and 151.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 786.03 ms. Allocated memory is still 201.3 MB. Free memory was 151.0 MB in the beginning and 106.7 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11127.20 ms. Allocated memory was 201.3 MB in the beginning and 406.3 MB in the end (delta: 205.0 MB). Free memory was 106.1 MB in the beginning and 296.2 MB in the end (delta: -190.2 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4653 VarBasedMoverChecksPositive, 173 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 209 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t1285, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t1286, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, 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] 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_p0_EAX=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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 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) [L760] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L760] 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)) [L761] 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_p0_EAX=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=1, 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] [L761] 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)) [L762] 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)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$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)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, 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] [L771] 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_p0_EAX=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=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=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 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 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=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=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 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 [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.8s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1347 SDtfs, 1418 SDslu, 2525 SDs, 0 SdLazy, 1450 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 18 SyntacticMatches, 7 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8220occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 1945 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 409 NumberOfCodeBlocks, 409 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 346 ConstructedInterpolants, 0 QuantifiedInterpolants, 40998 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...