/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/mix012_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:31:37,255 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:31:37,257 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:31:37,276 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:31:37,276 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:31:37,278 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:31:37,280 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:31:37,291 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:31:37,295 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:31:37,298 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:31:37,300 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:31:37,302 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:31:37,302 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:31:37,304 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:31:37,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:31:37,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:31:37,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:31:37,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:31:37,311 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:31:37,316 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:31:37,320 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:31:37,324 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:31:37,325 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:31:37,325 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:31:37,327 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:31:37,328 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:31:37,328 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:31:37,330 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:31:37,331 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:31:37,332 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:31:37,332 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:31:37,333 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:31:37,334 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:31:37,335 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:31:37,336 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:31:37,336 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:31:37,336 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:31:37,337 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:31:37,337 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:31:37,338 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:31:37,339 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:31:37,340 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 21:31:37,360 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:31:37,360 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:31:37,361 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:31:37,361 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:31:37,366 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:31:37,366 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:31:37,367 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:31:37,367 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:31:37,367 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:31:37,367 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:31:37,367 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:31:37,368 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:31:37,368 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:31:37,368 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:31:37,368 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:31:37,368 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:31:37,368 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:31:37,370 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:31:37,370 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:31:37,370 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:31:37,370 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:31:37,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:31:37,373 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:31:37,373 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:31:37,375 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:31:37,376 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:31:37,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:31:37,376 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:31:37,376 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:31:37,376 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:31:37,704 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:31:37,718 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:31:37,721 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:31:37,723 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:31:37,723 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:31:37,724 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_rmo.opt.i [2019-12-26 21:31:37,785 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5775066b5/462556c5d31f4d1689e795db8bb3a4ce/FLAGf4753a7ae [2019-12-26 21:31:38,354 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:31:38,355 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_rmo.opt.i [2019-12-26 21:31:38,375 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5775066b5/462556c5d31f4d1689e795db8bb3a4ce/FLAGf4753a7ae [2019-12-26 21:31:38,627 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5775066b5/462556c5d31f4d1689e795db8bb3a4ce [2019-12-26 21:31:38,636 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:31:38,638 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:31:38,639 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:31:38,639 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:31:38,643 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:31:38,644 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:31:38" (1/1) ... [2019-12-26 21:31:38,647 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85f7a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:31:38, skipping insertion in model container [2019-12-26 21:31:38,647 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:31:38" (1/1) ... [2019-12-26 21:31:38,655 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:31:38,724 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:31:39,380 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:31:39,394 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:31:39,467 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:31:39,538 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:31:39,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:31:39 WrapperNode [2019-12-26 21:31:39,539 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:31:39,540 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:31:39,540 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:31:39,540 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:31:39,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:31:39" (1/1) ... [2019-12-26 21:31:39,569 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:31:39" (1/1) ... [2019-12-26 21:31:39,600 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:31:39,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:31:39,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:31:39,601 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:31:39,612 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:31:39" (1/1) ... [2019-12-26 21:31:39,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:31:39" (1/1) ... [2019-12-26 21:31:39,621 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:31:39" (1/1) ... [2019-12-26 21:31:39,621 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:31:39" (1/1) ... [2019-12-26 21:31:39,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:31:39" (1/1) ... [2019-12-26 21:31:39,644 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:31:39" (1/1) ... [2019-12-26 21:31:39,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:31:39" (1/1) ... [2019-12-26 21:31:39,653 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:31:39,654 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:31:39,654 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:31:39,654 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:31:39,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:31:39" (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 21:31:39,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:31:39,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:31:39,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:31:39,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:31:39,742 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:31:39,742 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:31:39,742 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:31:39,742 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:31:39,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:31:39,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:31:39,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:31:39,745 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 21:31:40,447 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:31:40,448 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:31:40,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:31:40 BoogieIcfgContainer [2019-12-26 21:31:40,449 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:31:40,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:31:40,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:31:40,455 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:31:40,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:31:38" (1/3) ... [2019-12-26 21:31:40,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48b73e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:31:40, skipping insertion in model container [2019-12-26 21:31:40,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:31:39" (2/3) ... [2019-12-26 21:31:40,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48b73e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:31:40, skipping insertion in model container [2019-12-26 21:31:40,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:31:40" (3/3) ... [2019-12-26 21:31:40,459 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_rmo.opt.i [2019-12-26 21:31:40,468 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:31:40,468 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:31:40,476 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:31:40,477 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:31:40,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,518 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,518 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,518 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,519 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,519 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,535 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,536 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,605 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,605 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,606 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,613 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,616 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:31:40,632 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 21:31:40,653 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:31:40,653 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:31:40,653 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:31:40,653 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:31:40,654 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:31:40,654 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:31:40,654 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:31:40,654 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:31:40,676 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-26 21:31:40,678 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-26 21:31:40,781 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-26 21:31:40,781 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:31:40,794 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 21:31:40,813 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-26 21:31:40,856 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-26 21:31:40,856 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:31:40,862 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 21:31:40,876 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-26 21:31:40,877 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:31:45,564 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-12-26 21:31:45,667 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-12-26 21:31:46,098 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-26 21:31:46,206 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-26 21:31:46,498 INFO L206 etLargeBlockEncoding]: Checked pairs total: 77720 [2019-12-26 21:31:46,498 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-26 21:31:46,502 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-26 21:31:47,038 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8912 states. [2019-12-26 21:31:47,040 INFO L276 IsEmpty]: Start isEmpty. Operand 8912 states. [2019-12-26 21:31:47,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 21:31:47,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:47,046 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 21:31:47,046 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:47,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:47,051 INFO L82 PathProgramCache]: Analyzing trace with hash 795178, now seen corresponding path program 1 times [2019-12-26 21:31:47,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:47,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96137200] [2019-12-26 21:31:47,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:47,257 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 21:31:47,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96137200] [2019-12-26 21:31:47,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:47,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:31:47,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918027265] [2019-12-26 21:31:47,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:31:47,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:47,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:31:47,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:31:47,279 INFO L87 Difference]: Start difference. First operand 8912 states. Second operand 3 states. [2019-12-26 21:31:47,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:47,532 INFO L93 Difference]: Finished difference Result 8760 states and 28314 transitions. [2019-12-26 21:31:47,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:31:47,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 21:31:47,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:47,653 INFO L225 Difference]: With dead ends: 8760 [2019-12-26 21:31:47,653 INFO L226 Difference]: Without dead ends: 7798 [2019-12-26 21:31:47,654 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 21:31:47,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7798 states. [2019-12-26 21:31:48,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7798 to 7798. [2019-12-26 21:31:48,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7798 states. [2019-12-26 21:31:48,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7798 states to 7798 states and 25120 transitions. [2019-12-26 21:31:48,153 INFO L78 Accepts]: Start accepts. Automaton has 7798 states and 25120 transitions. Word has length 3 [2019-12-26 21:31:48,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:48,154 INFO L462 AbstractCegarLoop]: Abstraction has 7798 states and 25120 transitions. [2019-12-26 21:31:48,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:31:48,154 INFO L276 IsEmpty]: Start isEmpty. Operand 7798 states and 25120 transitions. [2019-12-26 21:31:48,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 21:31:48,157 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:48,157 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:48,158 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:48,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:48,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1406163788, now seen corresponding path program 1 times [2019-12-26 21:31:48,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:48,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057029890] [2019-12-26 21:31:48,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:48,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:48,271 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 21:31:48,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057029890] [2019-12-26 21:31:48,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:48,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:31:48,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589227675] [2019-12-26 21:31:48,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:31:48,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:48,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:31:48,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:31:48,276 INFO L87 Difference]: Start difference. First operand 7798 states and 25120 transitions. Second operand 3 states. [2019-12-26 21:31:48,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:48,309 INFO L93 Difference]: Finished difference Result 1232 states and 2767 transitions. [2019-12-26 21:31:48,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:31:48,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-26 21:31:48,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:48,316 INFO L225 Difference]: With dead ends: 1232 [2019-12-26 21:31:48,317 INFO L226 Difference]: Without dead ends: 1232 [2019-12-26 21:31:48,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:31:48,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-26 21:31:48,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-12-26 21:31:48,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-12-26 21:31:48,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2767 transitions. [2019-12-26 21:31:48,350 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2767 transitions. Word has length 11 [2019-12-26 21:31:48,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:48,350 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2767 transitions. [2019-12-26 21:31:48,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:31:48,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2767 transitions. [2019-12-26 21:31:48,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 21:31:48,356 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:48,357 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:31:48,357 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:48,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:48,357 INFO L82 PathProgramCache]: Analyzing trace with hash 540130104, now seen corresponding path program 1 times [2019-12-26 21:31:48,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:48,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549314167] [2019-12-26 21:31:48,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:48,523 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 21:31:48,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549314167] [2019-12-26 21:31:48,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:48,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:31:48,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168063559] [2019-12-26 21:31:48,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:31:48,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:48,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:31:48,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:31:48,526 INFO L87 Difference]: Start difference. First operand 1232 states and 2767 transitions. Second operand 5 states. [2019-12-26 21:31:48,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:48,802 INFO L93 Difference]: Finished difference Result 1829 states and 4038 transitions. [2019-12-26 21:31:48,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:31:48,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-26 21:31:48,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:48,812 INFO L225 Difference]: With dead ends: 1829 [2019-12-26 21:31:48,812 INFO L226 Difference]: Without dead ends: 1829 [2019-12-26 21:31:48,813 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 21:31:48,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2019-12-26 21:31:48,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1572. [2019-12-26 21:31:48,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-12-26 21:31:48,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 3508 transitions. [2019-12-26 21:31:48,856 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 3508 transitions. Word has length 14 [2019-12-26 21:31:48,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:48,856 INFO L462 AbstractCegarLoop]: Abstraction has 1572 states and 3508 transitions. [2019-12-26 21:31:48,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:31:48,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 3508 transitions. [2019-12-26 21:31:48,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-26 21:31:48,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:48,858 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 21:31:48,859 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:48,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:48,859 INFO L82 PathProgramCache]: Analyzing trace with hash 603755618, now seen corresponding path program 1 times [2019-12-26 21:31:48,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:48,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438495856] [2019-12-26 21:31:48,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:48,997 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 21:31:48,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438495856] [2019-12-26 21:31:48,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:48,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:31:48,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674777267] [2019-12-26 21:31:48,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:31:48,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:48,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:31:48,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:31:48,999 INFO L87 Difference]: Start difference. First operand 1572 states and 3508 transitions. Second operand 6 states. [2019-12-26 21:31:49,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:49,411 INFO L93 Difference]: Finished difference Result 2337 states and 5011 transitions. [2019-12-26 21:31:49,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 21:31:49,411 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-26 21:31:49,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:49,424 INFO L225 Difference]: With dead ends: 2337 [2019-12-26 21:31:49,424 INFO L226 Difference]: Without dead ends: 2337 [2019-12-26 21:31:49,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:31:49,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2019-12-26 21:31:49,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 1705. [2019-12-26 21:31:49,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1705 states. [2019-12-26 21:31:49,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 3772 transitions. [2019-12-26 21:31:49,547 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 3772 transitions. Word has length 24 [2019-12-26 21:31:49,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:49,548 INFO L462 AbstractCegarLoop]: Abstraction has 1705 states and 3772 transitions. [2019-12-26 21:31:49,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:31:49,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 3772 transitions. [2019-12-26 21:31:49,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 21:31:49,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:49,550 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 21:31:49,551 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:49,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:49,551 INFO L82 PathProgramCache]: Analyzing trace with hash 461887986, now seen corresponding path program 1 times [2019-12-26 21:31:49,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:49,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840303634] [2019-12-26 21:31:49,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:49,634 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 21:31:49,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840303634] [2019-12-26 21:31:49,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:49,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:31:49,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608592906] [2019-12-26 21:31:49,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:31:49,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:49,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:31:49,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:31:49,637 INFO L87 Difference]: Start difference. First operand 1705 states and 3772 transitions. Second operand 3 states. [2019-12-26 21:31:49,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:49,649 INFO L93 Difference]: Finished difference Result 1704 states and 3770 transitions. [2019-12-26 21:31:49,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:31:49,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-26 21:31:49,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:49,659 INFO L225 Difference]: With dead ends: 1704 [2019-12-26 21:31:49,659 INFO L226 Difference]: Without dead ends: 1704 [2019-12-26 21:31:49,660 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 21:31:49,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states. [2019-12-26 21:31:49,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1704. [2019-12-26 21:31:49,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2019-12-26 21:31:49,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 3770 transitions. [2019-12-26 21:31:49,696 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 3770 transitions. Word has length 26 [2019-12-26 21:31:49,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:49,696 INFO L462 AbstractCegarLoop]: Abstraction has 1704 states and 3770 transitions. [2019-12-26 21:31:49,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:31:49,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 3770 transitions. [2019-12-26 21:31:49,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 21:31:49,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:49,699 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 21:31:49,699 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:49,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:49,700 INFO L82 PathProgramCache]: Analyzing trace with hash -691470702, now seen corresponding path program 1 times [2019-12-26 21:31:49,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:49,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646236906] [2019-12-26 21:31:49,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:49,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:49,772 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 21:31:49,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646236906] [2019-12-26 21:31:49,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:49,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:31:49,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11891942] [2019-12-26 21:31:49,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:31:49,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:49,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:31:49,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:31:49,774 INFO L87 Difference]: Start difference. First operand 1704 states and 3770 transitions. Second operand 4 states. [2019-12-26 21:31:49,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:49,803 INFO L93 Difference]: Finished difference Result 2700 states and 6022 transitions. [2019-12-26 21:31:49,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:31:49,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-26 21:31:49,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:49,810 INFO L225 Difference]: With dead ends: 2700 [2019-12-26 21:31:49,811 INFO L226 Difference]: Without dead ends: 1250 [2019-12-26 21:31:49,811 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 21:31:49,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2019-12-26 21:31:49,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1233. [2019-12-26 21:31:49,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2019-12-26 21:31:49,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 2691 transitions. [2019-12-26 21:31:49,837 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 2691 transitions. Word has length 27 [2019-12-26 21:31:49,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:49,837 INFO L462 AbstractCegarLoop]: Abstraction has 1233 states and 2691 transitions. [2019-12-26 21:31:49,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:31:49,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 2691 transitions. [2019-12-26 21:31:49,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 21:31:49,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:49,839 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 21:31:49,839 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:49,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:49,840 INFO L82 PathProgramCache]: Analyzing trace with hash -250638352, now seen corresponding path program 2 times [2019-12-26 21:31:49,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:49,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602835614] [2019-12-26 21:31:49,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:49,907 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 21:31:49,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602835614] [2019-12-26 21:31:49,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:49,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:31:49,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672292753] [2019-12-26 21:31:49,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:31:49,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:49,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:31:49,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:31:49,910 INFO L87 Difference]: Start difference. First operand 1233 states and 2691 transitions. Second operand 5 states. [2019-12-26 21:31:50,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:50,360 INFO L93 Difference]: Finished difference Result 1899 states and 4075 transitions. [2019-12-26 21:31:50,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:31:50,360 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-26 21:31:50,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:50,368 INFO L225 Difference]: With dead ends: 1899 [2019-12-26 21:31:50,369 INFO L226 Difference]: Without dead ends: 1899 [2019-12-26 21:31:50,369 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 21:31:50,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2019-12-26 21:31:50,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1704. [2019-12-26 21:31:50,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2019-12-26 21:31:50,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 3701 transitions. [2019-12-26 21:31:50,405 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 3701 transitions. Word has length 27 [2019-12-26 21:31:50,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:50,406 INFO L462 AbstractCegarLoop]: Abstraction has 1704 states and 3701 transitions. [2019-12-26 21:31:50,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:31:50,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 3701 transitions. [2019-12-26 21:31:50,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 21:31:50,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:50,409 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] [2019-12-26 21:31:50,409 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:50,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:50,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1889347286, now seen corresponding path program 1 times [2019-12-26 21:31:50,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:50,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489284132] [2019-12-26 21:31:50,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:50,449 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 21:31:50,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489284132] [2019-12-26 21:31:50,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:50,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:31:50,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453376620] [2019-12-26 21:31:50,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:31:50,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:50,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:31:50,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:31:50,452 INFO L87 Difference]: Start difference. First operand 1704 states and 3701 transitions. Second operand 4 states. [2019-12-26 21:31:50,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:50,471 INFO L93 Difference]: Finished difference Result 921 states and 1892 transitions. [2019-12-26 21:31:50,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:31:50,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-26 21:31:50,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:50,481 INFO L225 Difference]: With dead ends: 921 [2019-12-26 21:31:50,481 INFO L226 Difference]: Without dead ends: 824 [2019-12-26 21:31:50,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:31:50,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2019-12-26 21:31:50,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 782. [2019-12-26 21:31:50,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-12-26 21:31:50,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1664 transitions. [2019-12-26 21:31:50,497 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1664 transitions. Word has length 28 [2019-12-26 21:31:50,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:50,498 INFO L462 AbstractCegarLoop]: Abstraction has 782 states and 1664 transitions. [2019-12-26 21:31:50,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:31:50,498 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1664 transitions. [2019-12-26 21:31:50,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-26 21:31:50,500 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:50,501 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 21:31:50,501 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:50,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:50,501 INFO L82 PathProgramCache]: Analyzing trace with hash -317989854, now seen corresponding path program 1 times [2019-12-26 21:31:50,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:50,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624819027] [2019-12-26 21:31:50,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:50,600 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 21:31:50,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624819027] [2019-12-26 21:31:50,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:50,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:31:50,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460033984] [2019-12-26 21:31:50,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:31:50,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:50,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:31:50,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:31:50,603 INFO L87 Difference]: Start difference. First operand 782 states and 1664 transitions. Second operand 7 states. [2019-12-26 21:31:50,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:50,867 INFO L93 Difference]: Finished difference Result 1342 states and 2781 transitions. [2019-12-26 21:31:50,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 21:31:50,868 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-26 21:31:50,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:50,871 INFO L225 Difference]: With dead ends: 1342 [2019-12-26 21:31:50,871 INFO L226 Difference]: Without dead ends: 903 [2019-12-26 21:31:50,871 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 21:31:50,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-12-26 21:31:50,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 773. [2019-12-26 21:31:50,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-12-26 21:31:50,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1630 transitions. [2019-12-26 21:31:50,886 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1630 transitions. Word has length 50 [2019-12-26 21:31:50,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:50,887 INFO L462 AbstractCegarLoop]: Abstraction has 773 states and 1630 transitions. [2019-12-26 21:31:50,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:31:50,887 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1630 transitions. [2019-12-26 21:31:50,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-26 21:31:50,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:50,889 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 21:31:50,889 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:50,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:50,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1216040192, now seen corresponding path program 2 times [2019-12-26 21:31:50,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:50,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019570183] [2019-12-26 21:31:50,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:50,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:50,991 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 21:31:50,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019570183] [2019-12-26 21:31:50,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:50,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:31:50,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450026799] [2019-12-26 21:31:50,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:31:50,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:50,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:31:50,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:31:50,993 INFO L87 Difference]: Start difference. First operand 773 states and 1630 transitions. Second operand 7 states. [2019-12-26 21:31:51,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:51,576 INFO L93 Difference]: Finished difference Result 1033 states and 2141 transitions. [2019-12-26 21:31:51,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 21:31:51,576 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-26 21:31:51,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:51,579 INFO L225 Difference]: With dead ends: 1033 [2019-12-26 21:31:51,579 INFO L226 Difference]: Without dead ends: 1027 [2019-12-26 21:31:51,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:31:51,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2019-12-26 21:31:51,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 827. [2019-12-26 21:31:51,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2019-12-26 21:31:51,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1729 transitions. [2019-12-26 21:31:51,596 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1729 transitions. Word has length 50 [2019-12-26 21:31:51,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:51,596 INFO L462 AbstractCegarLoop]: Abstraction has 827 states and 1729 transitions. [2019-12-26 21:31:51,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:31:51,596 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1729 transitions. [2019-12-26 21:31:51,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-26 21:31:51,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:51,599 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 21:31:51,599 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:51,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:51,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1826446246, now seen corresponding path program 3 times [2019-12-26 21:31:51,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:51,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296384358] [2019-12-26 21:31:51,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:51,664 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 21:31:51,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296384358] [2019-12-26 21:31:51,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:51,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:31:51,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008679703] [2019-12-26 21:31:51,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:31:51,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:51,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:31:51,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:31:51,666 INFO L87 Difference]: Start difference. First operand 827 states and 1729 transitions. Second operand 3 states. [2019-12-26 21:31:51,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:51,711 INFO L93 Difference]: Finished difference Result 1100 states and 2305 transitions. [2019-12-26 21:31:51,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:31:51,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-26 21:31:51,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:51,716 INFO L225 Difference]: With dead ends: 1100 [2019-12-26 21:31:51,716 INFO L226 Difference]: Without dead ends: 1100 [2019-12-26 21:31:51,716 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 21:31:51,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2019-12-26 21:31:51,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 884. [2019-12-26 21:31:51,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 884 states. [2019-12-26 21:31:51,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1865 transitions. [2019-12-26 21:31:51,733 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1865 transitions. Word has length 50 [2019-12-26 21:31:51,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:51,737 INFO L462 AbstractCegarLoop]: Abstraction has 884 states and 1865 transitions. [2019-12-26 21:31:51,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:31:51,737 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1865 transitions. [2019-12-26 21:31:51,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 21:31:51,739 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:51,739 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 21:31:51,740 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:51,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:51,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1408508718, now seen corresponding path program 1 times [2019-12-26 21:31:51,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:51,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548344780] [2019-12-26 21:31:51,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:51,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:51,901 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 21:31:51,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548344780] [2019-12-26 21:31:51,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:51,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:31:51,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729536716] [2019-12-26 21:31:51,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:31:51,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:51,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:31:51,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:31:51,903 INFO L87 Difference]: Start difference. First operand 884 states and 1865 transitions. Second operand 8 states. [2019-12-26 21:31:52,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:52,683 INFO L93 Difference]: Finished difference Result 1138 states and 2341 transitions. [2019-12-26 21:31:52,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 21:31:52,683 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-12-26 21:31:52,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:52,687 INFO L225 Difference]: With dead ends: 1138 [2019-12-26 21:31:52,688 INFO L226 Difference]: Without dead ends: 1138 [2019-12-26 21:31:52,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-12-26 21:31:52,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2019-12-26 21:31:52,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 944. [2019-12-26 21:31:52,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2019-12-26 21:31:52,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1987 transitions. [2019-12-26 21:31:52,705 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1987 transitions. Word has length 51 [2019-12-26 21:31:52,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:52,706 INFO L462 AbstractCegarLoop]: Abstraction has 944 states and 1987 transitions. [2019-12-26 21:31:52,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:31:52,706 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1987 transitions. [2019-12-26 21:31:52,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 21:31:52,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:52,708 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 21:31:52,709 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:52,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:52,709 INFO L82 PathProgramCache]: Analyzing trace with hash 544395700, now seen corresponding path program 2 times [2019-12-26 21:31:52,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:52,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097348885] [2019-12-26 21:31:52,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:31:52,785 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 21:31:52,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097348885] [2019-12-26 21:31:52,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:31:52,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:31:52,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290086766] [2019-12-26 21:31:52,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:31:52,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:31:52,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:31:52,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:31:52,788 INFO L87 Difference]: Start difference. First operand 944 states and 1987 transitions. Second operand 3 states. [2019-12-26 21:31:52,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:31:52,802 INFO L93 Difference]: Finished difference Result 943 states and 1985 transitions. [2019-12-26 21:31:52,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:31:52,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-26 21:31:52,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:31:52,804 INFO L225 Difference]: With dead ends: 943 [2019-12-26 21:31:52,805 INFO L226 Difference]: Without dead ends: 943 [2019-12-26 21:31:52,805 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 21:31:52,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2019-12-26 21:31:52,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 789. [2019-12-26 21:31:52,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-12-26 21:31:52,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1685 transitions. [2019-12-26 21:31:52,822 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1685 transitions. Word has length 51 [2019-12-26 21:31:52,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:31:52,823 INFO L462 AbstractCegarLoop]: Abstraction has 789 states and 1685 transitions. [2019-12-26 21:31:52,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:31:52,823 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1685 transitions. [2019-12-26 21:31:52,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 21:31:52,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:31:52,826 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 21:31:52,826 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:31:52,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:31:52,826 INFO L82 PathProgramCache]: Analyzing trace with hash 355104308, now seen corresponding path program 1 times [2019-12-26 21:31:52,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:31:52,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649366568] [2019-12-26 21:31:52,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:31:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:31:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:31:52,976 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 21:31:52,976 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 21:31:52,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L799: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (= 0 v_~y$r_buff0_thd2~0_418) (= v_~main$tmp_guard0~0_19 0) (= 0 v_~__unbuffered_cnt~0_61) (= v_~y$r_buff0_thd0~0_150 0) (= v_~y$r_buff1_thd1~0_136 0) (= 0 v_~y$w_buff0~0_517) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t315~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t315~0.base_27|) |v_ULTIMATE.start_main_~#t315~0.offset_19| 0))) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd2~0_265) (= v_~weak$$choice2~0_161 0) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 v_~y$flush_delayed~0_39) (= v_~__unbuffered_p1_EBX~0_45 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t315~0.base_27| 4)) (< 0 |v_#StackHeapBarrier_15|) (= |v_#valid_61| (store .cse0 |v_ULTIMATE.start_main_~#t315~0.base_27| 1)) (= v_~y$r_buff0_thd1~0_219 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$w_buff1~0_303 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t315~0.base_27|) 0) (= 0 |v_#NULL.base_6|) (= v_~y$r_buff1_thd0~0_161 0) (= 0 v_~weak$$choice0~0_24) (= 0 v_~__unbuffered_p0_EAX~0_105) (= v_~main$tmp_guard1~0_47 0) (= v_~x~0_99 0) (= 0 |v_ULTIMATE.start_main_~#t315~0.offset_19|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t315~0.base_27|) (= v_~y~0_150 0) (= v_~y$w_buff1_used~0_497 0) (= v_~y$w_buff0_used~0_750 0) (= v_~y$mem_tmp~0_25 0) (= 0 v_~__unbuffered_p1_EAX~0_50))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t315~0.offset=|v_ULTIMATE.start_main_~#t315~0.offset_19|, ULTIMATE.start_main_~#t316~0.base=|v_ULTIMATE.start_main_~#t316~0.base_28|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_750, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_47, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_38|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_136, ~y$mem_tmp~0=v_~y$mem_tmp~0_25, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, ~y$w_buff0~0=v_~y$w_buff0~0_517, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_17|, ~y~0=v_~y~0_150, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_45, ULTIMATE.start_main_~#t315~0.base=|v_ULTIMATE.start_main_~#t315~0.base_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ULTIMATE.start_main_~#t316~0.offset=|v_ULTIMATE.start_main_~#t316~0.offset_20|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_265, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~y$w_buff1~0=v_~y$w_buff1~0_303, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_30|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_150, #valid=|v_#valid_61|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_418, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_161, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_161, ~x~0=v_~x~0_99, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_497} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t315~0.offset, ULTIMATE.start_main_~#t316~0.base, ~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, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t315~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t316~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#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 21:31:52,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L799-1-->L801: Formula: (and (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t316~0.base_10| 1)) (= |v_ULTIMATE.start_main_~#t316~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t316~0.base_10|)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t316~0.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t316~0.base_10|) |v_ULTIMATE.start_main_~#t316~0.offset_9| 1)) |v_#memory_int_5|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t316~0.base_10| 4)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t316~0.base_10|) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t316~0.base_10|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t316~0.base=|v_ULTIMATE.start_main_~#t316~0.base_10|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t316~0.offset=|v_ULTIMATE.start_main_~#t316~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t316~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t316~0.offset] because there is no mapped edge [2019-12-26 21:31:52,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L4-->L740: Formula: (and (= ~x~0_In-724431735 ~__unbuffered_p0_EAX~0_Out-724431735) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-724431735)) (= ~y$r_buff1_thd2~0_Out-724431735 ~y$r_buff0_thd2~0_In-724431735) (= 1 ~y$r_buff0_thd1~0_Out-724431735) (= ~y$r_buff1_thd0~0_Out-724431735 ~y$r_buff0_thd0~0_In-724431735) (= ~y$r_buff1_thd1~0_Out-724431735 ~y$r_buff0_thd1~0_In-724431735)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-724431735, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-724431735, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-724431735, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-724431735, ~x~0=~x~0_In-724431735} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-724431735, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-724431735, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-724431735, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-724431735, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-724431735, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-724431735, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-724431735, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-724431735, ~x~0=~x~0_In-724431735} 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 21:31:52,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L741-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1143748602 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-1143748602 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1143748602| ~y$w_buff0_used~0_In-1143748602) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1143748602| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1143748602, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1143748602} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1143748602|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1143748602, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1143748602} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 21:31:52,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1449950654 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1449950654 256))) (.cse3 (= (mod ~y$r_buff1_thd1~0_In1449950654 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1449950654 256) 0))) (or (and (= ~y$w_buff1_used~0_In1449950654 |P0Thread1of1ForFork0_#t~ite6_Out1449950654|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1449950654|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1449950654, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1449950654, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1449950654, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1449950654} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1449950654|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1449950654, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1449950654, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1449950654, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1449950654} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 21:31:52,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L743-->L744: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In110238752 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In110238752 256) 0))) (or (and (= ~y$r_buff0_thd1~0_Out110238752 ~y$r_buff0_thd1~0_In110238752) (or .cse0 .cse1)) (and (not .cse1) (= ~y$r_buff0_thd1~0_Out110238752 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In110238752, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In110238752} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In110238752, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out110238752|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out110238752} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:31:52,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In670619936 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In670619936 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In670619936 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In670619936 256) 0))) (or (and (= ~y$r_buff1_thd1~0_In670619936 |P0Thread1of1ForFork0_#t~ite8_Out670619936|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out670619936|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In670619936, ~y$w_buff0_used~0=~y$w_buff0_used~0_In670619936, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In670619936, ~y$w_buff1_used~0=~y$w_buff1_used~0_In670619936} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In670619936, ~y$w_buff0_used~0=~y$w_buff0_used~0_In670619936, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out670619936|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In670619936, ~y$w_buff1_used~0=~y$w_buff1_used~0_In670619936} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 21:31:52,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L744-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} 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 21:31:52,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L766-->L766-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1601976884 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite18_Out-1601976884| |P1Thread1of1ForFork1_#t~ite17_Out-1601976884|) (= ~y$w_buff1~0_In-1601976884 |P1Thread1of1ForFork1_#t~ite17_Out-1601976884|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1601976884 256)))) (or (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-1601976884 256))) (and (= 0 (mod ~y$r_buff1_thd2~0_In-1601976884 256)) .cse0) (= 0 (mod ~y$w_buff0_used~0_In-1601976884 256)))) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite17_In-1601976884| |P1Thread1of1ForFork1_#t~ite17_Out-1601976884|) (not .cse1) (= ~y$w_buff1~0_In-1601976884 |P1Thread1of1ForFork1_#t~ite18_Out-1601976884|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1601976884, ~y$w_buff1~0=~y$w_buff1~0_In-1601976884, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1601976884, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1601976884, ~weak$$choice2~0=~weak$$choice2~0_In-1601976884, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-1601976884|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1601976884} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1601976884, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-1601976884|, ~y$w_buff1~0=~y$w_buff1~0_In-1601976884, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1601976884, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1601976884, ~weak$$choice2~0=~weak$$choice2~0_In-1601976884, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-1601976884|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1601976884} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-26 21:31:52,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L767-->L767-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1563990958 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out-1563990958| ~y$w_buff0_used~0_In-1563990958) (= |P1Thread1of1ForFork1_#t~ite20_In-1563990958| |P1Thread1of1ForFork1_#t~ite20_Out-1563990958|) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1563990958 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-1563990958 256) 0) (and (= (mod ~y$w_buff1_used~0_In-1563990958 256) 0) .cse1) (and (= (mod ~y$r_buff1_thd2~0_In-1563990958 256) 0) .cse1))) .cse0 (= |P1Thread1of1ForFork1_#t~ite20_Out-1563990958| ~y$w_buff0_used~0_In-1563990958) (= |P1Thread1of1ForFork1_#t~ite21_Out-1563990958| |P1Thread1of1ForFork1_#t~ite20_Out-1563990958|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1563990958, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1563990958, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1563990958|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1563990958, ~weak$$choice2~0=~weak$$choice2~0_In-1563990958, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1563990958} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1563990958, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1563990958, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1563990958|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1563990958, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1563990958|, ~weak$$choice2~0=~weak$$choice2~0_In-1563990958, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1563990958} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-26 21:31:52,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L768-->L768-8: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-1353825401 256) 0)) (.cse5 (= (mod ~y$w_buff1_used~0_In-1353825401 256) 0)) (.cse0 (= 0 (mod ~weak$$choice2~0_In-1353825401 256))) (.cse1 (= |P1Thread1of1ForFork1_#t~ite24_Out-1353825401| |P1Thread1of1ForFork1_#t~ite23_Out-1353825401|)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1353825401 256))) (.cse4 (= 0 (mod ~y$r_buff0_thd2~0_In-1353825401 256)))) (or (and (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite23_Out-1353825401| ~y$w_buff1_used~0_In-1353825401) .cse1 (or .cse2 (and .cse3 .cse4) (and .cse4 .cse5))) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite24_Out-1353825401| ~y$w_buff1_used~0_In-1353825401) (= |P1Thread1of1ForFork1_#t~ite23_Out-1353825401| |P1Thread1of1ForFork1_#t~ite23_In-1353825401|))) (= |P1Thread1of1ForFork1_#t~ite22_In-1353825401| |P1Thread1of1ForFork1_#t~ite22_Out-1353825401|)) (let ((.cse6 (not .cse4))) (and (= |P1Thread1of1ForFork1_#t~ite23_Out-1353825401| |P1Thread1of1ForFork1_#t~ite22_Out-1353825401|) (= 0 |P1Thread1of1ForFork1_#t~ite22_Out-1353825401|) (not .cse2) (or (not .cse5) .cse6) .cse0 .cse1 (or .cse6 (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1353825401, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1353825401, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1353825401, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1353825401|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-1353825401|, ~weak$$choice2~0=~weak$$choice2~0_In-1353825401, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1353825401} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1353825401, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1353825401, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1353825401, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1353825401|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1353825401|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-1353825401|, ~weak$$choice2~0=~weak$$choice2~0_In-1353825401, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1353825401} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-26 21:31:52,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L768-8-->L770: Formula: (and (= v_~y$w_buff1_used~0_417 |v_P1Thread1of1ForFork1_#t~ite24_25|) (not (= 0 (mod v_~weak$$choice2~0_105 256))) (= v_~y$r_buff0_thd2~0_320 v_~y$r_buff0_thd2~0_319)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_320, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_25|, ~weak$$choice2~0=v_~weak$$choice2~0_105} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_319, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_22|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_24|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_20|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_35|, ~weak$$choice2~0=v_~weak$$choice2~0_105, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_28|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_417} 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 21:31:52,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L770-->L770-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In534410883 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite30_Out534410883| ~y$r_buff1_thd2~0_In534410883) (= |P1Thread1of1ForFork1_#t~ite28_In534410883| |P1Thread1of1ForFork1_#t~ite28_Out534410883|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In534410883| |P1Thread1of1ForFork1_#t~ite29_Out534410883|)) (let ((.cse1 (not (= (mod ~y$r_buff0_thd2~0_In534410883 256) 0)))) (and (not (= 0 (mod ~y$w_buff0_used~0_In534410883 256))) (= |P1Thread1of1ForFork1_#t~ite28_Out534410883| 0) (or (not (= 0 (mod ~y$r_buff1_thd2~0_In534410883 256))) .cse1) (= |P1Thread1of1ForFork1_#t~ite30_Out534410883| |P1Thread1of1ForFork1_#t~ite29_Out534410883|) .cse0 (= |P1Thread1of1ForFork1_#t~ite28_Out534410883| |P1Thread1of1ForFork1_#t~ite29_Out534410883|) (or (not (= 0 (mod ~y$w_buff1_used~0_In534410883 256))) .cse1))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In534410883, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In534410883|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In534410883, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In534410883, ~weak$$choice2~0=~weak$$choice2~0_In534410883, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In534410883|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In534410883} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In534410883, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out534410883|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out534410883|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In534410883, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In534410883, ~weak$$choice2~0=~weak$$choice2~0_In534410883, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out534410883|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In534410883} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-26 21:31:52,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L772-->L776: Formula: (and (= v_~y~0_43 v_~y$mem_tmp~0_8) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_8, ~y$flush_delayed~0=v_~y$flush_delayed~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_8, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-26 21:31:52,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L776-2-->L776-5: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1942567635 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1942567635 256))) (.cse1 (= |P1Thread1of1ForFork1_#t~ite32_Out1942567635| |P1Thread1of1ForFork1_#t~ite33_Out1942567635|))) (or (and (not .cse0) .cse1 (not .cse2) (= |P1Thread1of1ForFork1_#t~ite32_Out1942567635| ~y$w_buff1~0_In1942567635)) (and (or .cse0 .cse2) .cse1 (= |P1Thread1of1ForFork1_#t~ite32_Out1942567635| ~y~0_In1942567635)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1942567635, ~y$w_buff1~0=~y$w_buff1~0_In1942567635, ~y~0=~y~0_In1942567635, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1942567635} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1942567635, ~y$w_buff1~0=~y$w_buff1~0_In1942567635, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1942567635|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1942567635|, ~y~0=~y~0_In1942567635, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1942567635} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-26 21:31:52,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2061795028 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2061795028 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-2061795028|)) (and (= ~y$w_buff0_used~0_In-2061795028 |P1Thread1of1ForFork1_#t~ite34_Out-2061795028|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2061795028, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2061795028} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2061795028, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2061795028, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-2061795028|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-26 21:31:52,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L778-->L778-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In661427875 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In661427875 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In661427875 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In661427875 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out661427875|)) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In661427875 |P1Thread1of1ForFork1_#t~ite35_Out661427875|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In661427875, ~y$w_buff0_used~0=~y$w_buff0_used~0_In661427875, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In661427875, ~y$w_buff1_used~0=~y$w_buff1_used~0_In661427875} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In661427875, ~y$w_buff0_used~0=~y$w_buff0_used~0_In661427875, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In661427875, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out661427875|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In661427875} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-26 21:31:52,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In242913515 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In242913515 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out242913515|) (not .cse1)) (and (= ~y$r_buff0_thd2~0_In242913515 |P1Thread1of1ForFork1_#t~ite36_Out242913515|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In242913515, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In242913515} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In242913515, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In242913515, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out242913515|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-26 21:31:52,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L780-->L780-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-1663255287 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-1663255287 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1663255287 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-1663255287 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-1663255287 |P1Thread1of1ForFork1_#t~ite37_Out-1663255287|) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out-1663255287| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1663255287, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1663255287, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1663255287, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1663255287} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1663255287, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1663255287, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1663255287, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1663255287|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1663255287} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 21:31:52,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_174 |v_P1Thread1of1ForFork1_#t~ite37_34|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_34|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_174, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_33|} 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 21:31:52,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L801-1-->L807: Formula: (and (= 2 v_~__unbuffered_cnt~0_18) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-26 21:31:52,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L807-2-->L807-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1773213805 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1773213805 256)))) (or (and (= ~y~0_In-1773213805 |ULTIMATE.start_main_#t~ite40_Out-1773213805|) (or .cse0 .cse1)) (and (not .cse0) (= ~y$w_buff1~0_In-1773213805 |ULTIMATE.start_main_#t~ite40_Out-1773213805|) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1773213805, ~y~0=~y~0_In-1773213805, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1773213805, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1773213805} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1773213805|, ~y$w_buff1~0=~y$w_buff1~0_In-1773213805, ~y~0=~y~0_In-1773213805, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1773213805, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1773213805} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-26 21:31:52,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L807-4-->L808: Formula: (= v_~y~0_34 |v_ULTIMATE.start_main_#t~ite40_14|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~y~0=v_~y~0_34} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-26 21:31:52,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1219339959 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1219339959 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1219339959 |ULTIMATE.start_main_#t~ite42_Out-1219339959|)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-1219339959|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1219339959, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1219339959} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1219339959, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1219339959, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1219339959|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 21:31:52,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In742299063 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In742299063 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In742299063 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In742299063 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out742299063| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In742299063 |ULTIMATE.start_main_#t~ite43_Out742299063|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In742299063, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In742299063, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In742299063, ~y$w_buff1_used~0=~y$w_buff1_used~0_In742299063} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In742299063, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In742299063, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out742299063|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In742299063, ~y$w_buff1_used~0=~y$w_buff1_used~0_In742299063} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-26 21:31:52,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-2009560143 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-2009560143 256)))) (or (and (= ~y$r_buff0_thd0~0_In-2009560143 |ULTIMATE.start_main_#t~ite44_Out-2009560143|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-2009560143|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2009560143, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2009560143} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2009560143, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2009560143, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-2009560143|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 21:31:52,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1013553198 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1013553198 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1013553198 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1013553198 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-1013553198| ~y$r_buff1_thd0~0_In-1013553198) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1013553198|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1013553198, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1013553198, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1013553198, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1013553198} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1013553198, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1013553198, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1013553198, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1013553198|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1013553198} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 21:31:52,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L811-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_28 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~main$tmp_guard1~0_28 0) (= 1 v_~__unbuffered_p1_EAX~0_37) (= v_~__unbuffered_p1_EBX~0_29 0) (= 0 v_~__unbuffered_p0_EAX~0_76) (= v_~y$r_buff1_thd0~0_112 |v_ULTIMATE.start_main_#t~ite45_56|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_56|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_112, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_55|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} 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 21:31:53,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:31:53 BasicIcfg [2019-12-26 21:31:53,088 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 21:31:53,090 INFO L168 Benchmark]: Toolchain (without parser) took 14452.91 ms. Allocated memory was 145.8 MB in the beginning and 412.6 MB in the end (delta: 266.9 MB). Free memory was 100.5 MB in the beginning and 225.8 MB in the end (delta: -125.3 MB). Peak memory consumption was 141.5 MB. Max. memory is 7.1 GB. [2019-12-26 21:31:53,091 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-26 21:31:53,091 INFO L168 Benchmark]: CACSL2BoogieTranslator took 900.53 ms. Allocated memory was 145.8 MB in the beginning and 205.0 MB in the end (delta: 59.2 MB). Free memory was 100.3 MB in the beginning and 159.1 MB in the end (delta: -58.8 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-26 21:31:53,092 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.65 ms. Allocated memory is still 205.0 MB. Free memory was 159.1 MB in the beginning and 156.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 21:31:53,093 INFO L168 Benchmark]: Boogie Preprocessor took 52.54 ms. Allocated memory is still 205.0 MB. Free memory was 156.4 MB in the beginning and 154.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 21:31:53,093 INFO L168 Benchmark]: RCFGBuilder took 796.04 ms. Allocated memory is still 205.0 MB. Free memory was 154.4 MB in the beginning and 109.9 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2019-12-26 21:31:53,094 INFO L168 Benchmark]: TraceAbstraction took 12637.54 ms. Allocated memory was 205.0 MB in the beginning and 412.6 MB in the end (delta: 207.6 MB). Free memory was 109.2 MB in the beginning and 225.8 MB in the end (delta: -116.6 MB). Peak memory consumption was 91.0 MB. Max. memory is 7.1 GB. [2019-12-26 21:31:53,098 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.51 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 900.53 ms. Allocated memory was 145.8 MB in the beginning and 205.0 MB in the end (delta: 59.2 MB). Free memory was 100.3 MB in the beginning and 159.1 MB in the end (delta: -58.8 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.65 ms. Allocated memory is still 205.0 MB. Free memory was 159.1 MB in the beginning and 156.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.54 ms. Allocated memory is still 205.0 MB. Free memory was 156.4 MB in the beginning and 154.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 796.04 ms. Allocated memory is still 205.0 MB. Free memory was 154.4 MB in the beginning and 109.9 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12637.54 ms. Allocated memory was 205.0 MB in the beginning and 412.6 MB in the end (delta: 207.6 MB). Free memory was 109.2 MB in the beginning and 225.8 MB in the end (delta: -116.6 MB). Peak memory consumption was 91.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 148 ProgramPointsBefore, 75 ProgramPointsAfterwards, 182 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 30 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 28 ChoiceCompositions, 4966 VarBasedMoverChecksPositive, 278 VarBasedMoverChecksNegative, 167 SemBasedMoverChecksPositive, 218 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 77720 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L799] FCALL, FORK 0 pthread_create(&t315, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L726] 1 y$w_buff1 = y$w_buff0 [L727] 1 y$w_buff0 = 1 [L728] 1 y$w_buff1_used = y$w_buff0_used [L729] 1 y$w_buff0_used = (_Bool)1 [L801] FCALL, FORK 0 pthread_create(&t316, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L740] 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, __unbuffered_p1_EBX=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] [L754] 2 x = 1 [L757] 2 __unbuffered_p1_EAX = x [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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] [L764] 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=1, __unbuffered_p1_EBX=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] [L740] 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) [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 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 [L764] 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) [L765] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 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)) [L766] 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)) [L767] 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)) [L770] 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)) [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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] [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 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 [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L807] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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] [L808] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] 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 [L810] 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, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.3s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1631 SDtfs, 1397 SDslu, 3329 SDs, 0 SdLazy, 2289 SolverSat, 58 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 23 SyntacticMatches, 10 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8912occurred 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.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 2037 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 464 NumberOfCodeBlocks, 464 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 399 ConstructedInterpolants, 0 QuantifiedInterpolants, 51581 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...