/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi007_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:10:09,201 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:10:09,204 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:10:09,220 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:10:09,221 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:10:09,222 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:10:09,223 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:10:09,225 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:10:09,226 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:10:09,227 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:10:09,228 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:10:09,230 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:10:09,230 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:10:09,231 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:10:09,232 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:10:09,233 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:10:09,234 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:10:09,235 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:10:09,237 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:10:09,239 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:10:09,241 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:10:09,242 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:10:09,243 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:10:09,244 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:10:09,246 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:10:09,246 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:10:09,247 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:10:09,248 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:10:09,248 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:10:09,249 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:10:09,249 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:10:09,250 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:10:09,251 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:10:09,252 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:10:09,253 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:10:09,253 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:10:09,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:10:09,254 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:10:09,254 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:10:09,255 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:10:09,256 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:10:09,260 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 18:10:09,283 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:10:09,283 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:10:09,285 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:10:09,286 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:10:09,286 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:10:09,286 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:10:09,286 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:10:09,286 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:10:09,287 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:10:09,287 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:10:09,288 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:10:09,288 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:10:09,288 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:10:09,289 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:10:09,289 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:10:09,289 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:10:09,289 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:10:09,290 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:10:09,290 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:10:09,290 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:10:09,291 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:10:09,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:10:09,291 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:10:09,291 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:10:09,291 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:10:09,292 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:10:09,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:10:09,292 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:10:09,292 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:10:09,593 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:10:09,608 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:10:09,612 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:10:09,614 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:10:09,614 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:10:09,615 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_rmo.opt.i [2019-12-18 18:10:09,669 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c536a480/d3134d89aaa64c8eb1ed646f24747b12/FLAG4d684dc23 [2019-12-18 18:10:10,199 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:10:10,199 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_rmo.opt.i [2019-12-18 18:10:10,224 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c536a480/d3134d89aaa64c8eb1ed646f24747b12/FLAG4d684dc23 [2019-12-18 18:10:10,490 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c536a480/d3134d89aaa64c8eb1ed646f24747b12 [2019-12-18 18:10:10,500 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:10:10,502 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:10:10,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:10:10,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:10:10,507 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:10:10,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:10:10" (1/1) ... [2019-12-18 18:10:10,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f4bee38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:10:10, skipping insertion in model container [2019-12-18 18:10:10,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:10:10" (1/1) ... [2019-12-18 18:10:10,519 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:10:10,564 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:10:11,089 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:10:11,101 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:10:11,174 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:10:11,246 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:10:11,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:10:11 WrapperNode [2019-12-18 18:10:11,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:10:11,248 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:10:11,249 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:10:11,249 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:10:11,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:10:11" (1/1) ... [2019-12-18 18:10:11,277 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:10:11" (1/1) ... [2019-12-18 18:10:11,310 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:10:11,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:10:11,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:10:11,311 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:10:11,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:10:11" (1/1) ... [2019-12-18 18:10:11,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:10:11" (1/1) ... [2019-12-18 18:10:11,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:10:11" (1/1) ... [2019-12-18 18:10:11,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:10:11" (1/1) ... [2019-12-18 18:10:11,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:10:11" (1/1) ... [2019-12-18 18:10:11,342 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:10:11" (1/1) ... [2019-12-18 18:10:11,346 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:10:11" (1/1) ... [2019-12-18 18:10:11,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:10:11,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:10:11,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:10:11,352 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:10:11,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:10:11" (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-18 18:10:11,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:10:11,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:10:11,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:10:11,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:10:11,405 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:10:11,405 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:10:11,406 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:10:11,407 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:10:11,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:10:11,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:10:11,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:10:11,415 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 18:10:12,112 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:10:12,112 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:10:12,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:10:12 BoogieIcfgContainer [2019-12-18 18:10:12,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:10:12,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:10:12,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:10:12,118 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:10:12,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:10:10" (1/3) ... [2019-12-18 18:10:12,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f5561a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:10:12, skipping insertion in model container [2019-12-18 18:10:12,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:10:11" (2/3) ... [2019-12-18 18:10:12,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f5561a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:10:12, skipping insertion in model container [2019-12-18 18:10:12,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:10:12" (3/3) ... [2019-12-18 18:10:12,128 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_rmo.opt.i [2019-12-18 18:10:12,141 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:10:12,141 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:10:12,155 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:10:12,156 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:10:12,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,195 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,195 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,195 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,196 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,196 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,210 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,210 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,272 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,272 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,273 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,280 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,300 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:10:12,318 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 18:10:12,340 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:10:12,340 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:10:12,340 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:10:12,340 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:10:12,340 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:10:12,341 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:10:12,341 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:10:12,341 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:10:12,363 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-18 18:10:12,365 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 18:10:12,440 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 18:10:12,441 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:10:12,456 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 18:10:12,476 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 18:10:12,516 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 18:10:12,516 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:10:12,523 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 18:10:12,537 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 18:10:12,539 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:10:17,194 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 18:10:17,304 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 18:10:17,666 INFO L206 etLargeBlockEncoding]: Checked pairs total: 76691 [2019-12-18 18:10:17,667 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-18 18:10:17,670 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 90 transitions [2019-12-18 18:10:18,279 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9438 states. [2019-12-18 18:10:18,281 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states. [2019-12-18 18:10:18,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 18:10:18,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:10:18,288 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 18:10:18,288 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:10:18,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:10:18,294 INFO L82 PathProgramCache]: Analyzing trace with hash 790297, now seen corresponding path program 1 times [2019-12-18 18:10:18,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:10:18,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673958103] [2019-12-18 18:10:18,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:10:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:10:18,506 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-18 18:10:18,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673958103] [2019-12-18 18:10:18,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:10:18,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:10:18,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488105604] [2019-12-18 18:10:18,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:10:18,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:10:18,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:10:18,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:10:18,534 INFO L87 Difference]: Start difference. First operand 9438 states. Second operand 3 states. [2019-12-18 18:10:18,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:10:18,846 INFO L93 Difference]: Finished difference Result 9266 states and 29920 transitions. [2019-12-18 18:10:18,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:10:18,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 18:10:18,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:10:18,978 INFO L225 Difference]: With dead ends: 9266 [2019-12-18 18:10:18,978 INFO L226 Difference]: Without dead ends: 8258 [2019-12-18 18:10:18,979 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-18 18:10:19,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8258 states. [2019-12-18 18:10:19,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8258 to 8258. [2019-12-18 18:10:19,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8258 states. [2019-12-18 18:10:19,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8258 states to 8258 states and 26572 transitions. [2019-12-18 18:10:19,400 INFO L78 Accepts]: Start accepts. Automaton has 8258 states and 26572 transitions. Word has length 3 [2019-12-18 18:10:19,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:10:19,400 INFO L462 AbstractCegarLoop]: Abstraction has 8258 states and 26572 transitions. [2019-12-18 18:10:19,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:10:19,400 INFO L276 IsEmpty]: Start isEmpty. Operand 8258 states and 26572 transitions. [2019-12-18 18:10:19,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:10:19,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:10:19,406 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:10:19,406 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:10:19,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:10:19,407 INFO L82 PathProgramCache]: Analyzing trace with hash 316025548, now seen corresponding path program 1 times [2019-12-18 18:10:19,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:10:19,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505558629] [2019-12-18 18:10:19,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:10:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:10:19,586 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-18 18:10:19,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505558629] [2019-12-18 18:10:19,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:10:19,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:10:19,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349728114] [2019-12-18 18:10:19,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:10:19,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:10:19,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:10:19,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:10:19,590 INFO L87 Difference]: Start difference. First operand 8258 states and 26572 transitions. Second operand 4 states. [2019-12-18 18:10:20,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:10:20,110 INFO L93 Difference]: Finished difference Result 12603 states and 38772 transitions. [2019-12-18 18:10:20,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:10:20,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 18:10:20,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:10:20,188 INFO L225 Difference]: With dead ends: 12603 [2019-12-18 18:10:20,189 INFO L226 Difference]: Without dead ends: 12589 [2019-12-18 18:10:20,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:10:20,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12589 states. [2019-12-18 18:10:20,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12589 to 11299. [2019-12-18 18:10:20,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11299 states. [2019-12-18 18:10:20,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11299 states to 11299 states and 35365 transitions. [2019-12-18 18:10:20,644 INFO L78 Accepts]: Start accepts. Automaton has 11299 states and 35365 transitions. Word has length 11 [2019-12-18 18:10:20,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:10:20,644 INFO L462 AbstractCegarLoop]: Abstraction has 11299 states and 35365 transitions. [2019-12-18 18:10:20,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:10:20,645 INFO L276 IsEmpty]: Start isEmpty. Operand 11299 states and 35365 transitions. [2019-12-18 18:10:20,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 18:10:20,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:10:20,650 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:10:20,650 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:10:20,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:10:20,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1209477957, now seen corresponding path program 1 times [2019-12-18 18:10:20,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:10:20,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016941734] [2019-12-18 18:10:20,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:10:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:10:20,740 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-18 18:10:20,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016941734] [2019-12-18 18:10:20,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:10:20,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:10:20,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143404386] [2019-12-18 18:10:20,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:10:20,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:10:20,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:10:20,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:10:20,744 INFO L87 Difference]: Start difference. First operand 11299 states and 35365 transitions. Second operand 4 states. [2019-12-18 18:10:21,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:10:21,307 INFO L93 Difference]: Finished difference Result 13736 states and 42816 transitions. [2019-12-18 18:10:21,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:10:21,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 18:10:21,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:10:21,357 INFO L225 Difference]: With dead ends: 13736 [2019-12-18 18:10:21,358 INFO L226 Difference]: Without dead ends: 13736 [2019-12-18 18:10:21,358 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-18 18:10:21,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13736 states. [2019-12-18 18:10:21,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13736 to 12234. [2019-12-18 18:10:21,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12234 states. [2019-12-18 18:10:21,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12234 states to 12234 states and 38359 transitions. [2019-12-18 18:10:21,818 INFO L78 Accepts]: Start accepts. Automaton has 12234 states and 38359 transitions. Word has length 14 [2019-12-18 18:10:21,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:10:21,819 INFO L462 AbstractCegarLoop]: Abstraction has 12234 states and 38359 transitions. [2019-12-18 18:10:21,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:10:21,819 INFO L276 IsEmpty]: Start isEmpty. Operand 12234 states and 38359 transitions. [2019-12-18 18:10:21,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 18:10:21,823 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:10:21,823 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:10:21,823 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:10:21,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:10:21,824 INFO L82 PathProgramCache]: Analyzing trace with hash -572907870, now seen corresponding path program 1 times [2019-12-18 18:10:21,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:10:21,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573698086] [2019-12-18 18:10:21,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:10:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:10:21,924 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-18 18:10:21,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573698086] [2019-12-18 18:10:21,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:10:21,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:10:21,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734076449] [2019-12-18 18:10:21,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:10:21,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:10:21,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:10:21,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:10:21,929 INFO L87 Difference]: Start difference. First operand 12234 states and 38359 transitions. Second operand 3 states. [2019-12-18 18:10:22,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:10:22,028 INFO L93 Difference]: Finished difference Result 12209 states and 38285 transitions. [2019-12-18 18:10:22,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:10:22,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 18:10:22,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:10:22,084 INFO L225 Difference]: With dead ends: 12209 [2019-12-18 18:10:22,084 INFO L226 Difference]: Without dead ends: 12209 [2019-12-18 18:10:22,085 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-18 18:10:22,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12209 states. [2019-12-18 18:10:23,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12209 to 12209. [2019-12-18 18:10:23,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12209 states. [2019-12-18 18:10:23,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12209 states to 12209 states and 38285 transitions. [2019-12-18 18:10:23,093 INFO L78 Accepts]: Start accepts. Automaton has 12209 states and 38285 transitions. Word has length 16 [2019-12-18 18:10:23,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:10:23,094 INFO L462 AbstractCegarLoop]: Abstraction has 12209 states and 38285 transitions. [2019-12-18 18:10:23,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:10:23,094 INFO L276 IsEmpty]: Start isEmpty. Operand 12209 states and 38285 transitions. [2019-12-18 18:10:23,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 18:10:23,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:10:23,099 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:10:23,099 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:10:23,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:10:23,099 INFO L82 PathProgramCache]: Analyzing trace with hash -574911552, now seen corresponding path program 1 times [2019-12-18 18:10:23,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:10:23,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541542820] [2019-12-18 18:10:23,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:10:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:10:23,183 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-18 18:10:23,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541542820] [2019-12-18 18:10:23,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:10:23,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:10:23,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087509717] [2019-12-18 18:10:23,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:10:23,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:10:23,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:10:23,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:10:23,185 INFO L87 Difference]: Start difference. First operand 12209 states and 38285 transitions. Second operand 4 states. [2019-12-18 18:10:23,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:10:23,223 INFO L93 Difference]: Finished difference Result 2335 states and 5845 transitions. [2019-12-18 18:10:23,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:10:23,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 18:10:23,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:10:23,228 INFO L225 Difference]: With dead ends: 2335 [2019-12-18 18:10:23,228 INFO L226 Difference]: Without dead ends: 1651 [2019-12-18 18:10:23,229 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-18 18:10:23,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2019-12-18 18:10:23,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1635. [2019-12-18 18:10:23,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1635 states. [2019-12-18 18:10:23,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 3657 transitions. [2019-12-18 18:10:23,261 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 3657 transitions. Word has length 17 [2019-12-18 18:10:23,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:10:23,261 INFO L462 AbstractCegarLoop]: Abstraction has 1635 states and 3657 transitions. [2019-12-18 18:10:23,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:10:23,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 3657 transitions. [2019-12-18 18:10:23,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:10:23,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:10:23,264 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] [2019-12-18 18:10:23,264 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:10:23,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:10:23,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1133745070, now seen corresponding path program 1 times [2019-12-18 18:10:23,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:10:23,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006468970] [2019-12-18 18:10:23,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:10:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:10:23,408 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-18 18:10:23,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006468970] [2019-12-18 18:10:23,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:10:23,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:10:23,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915876586] [2019-12-18 18:10:23,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:10:23,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:10:23,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:10:23,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:10:23,411 INFO L87 Difference]: Start difference. First operand 1635 states and 3657 transitions. Second operand 6 states. [2019-12-18 18:10:24,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:10:24,178 INFO L93 Difference]: Finished difference Result 4528 states and 9998 transitions. [2019-12-18 18:10:24,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 18:10:24,179 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 18:10:24,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:10:24,190 INFO L225 Difference]: With dead ends: 4528 [2019-12-18 18:10:24,190 INFO L226 Difference]: Without dead ends: 4493 [2019-12-18 18:10:24,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:10:24,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4493 states. [2019-12-18 18:10:24,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4493 to 2195. [2019-12-18 18:10:24,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2195 states. [2019-12-18 18:10:24,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 2195 states and 4961 transitions. [2019-12-18 18:10:24,253 INFO L78 Accepts]: Start accepts. Automaton has 2195 states and 4961 transitions. Word has length 25 [2019-12-18 18:10:24,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:10:24,253 INFO L462 AbstractCegarLoop]: Abstraction has 2195 states and 4961 transitions. [2019-12-18 18:10:24,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:10:24,254 INFO L276 IsEmpty]: Start isEmpty. Operand 2195 states and 4961 transitions. [2019-12-18 18:10:24,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 18:10:24,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:10:24,257 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-18 18:10:24,258 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:10:24,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:10:24,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1963896570, now seen corresponding path program 1 times [2019-12-18 18:10:24,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:10:24,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549485537] [2019-12-18 18:10:24,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:10:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:10:24,501 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-18 18:10:24,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549485537] [2019-12-18 18:10:24,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:10:24,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:10:24,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195775219] [2019-12-18 18:10:24,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:10:24,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:10:24,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:10:24,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:10:24,504 INFO L87 Difference]: Start difference. First operand 2195 states and 4961 transitions. Second operand 6 states. [2019-12-18 18:10:25,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:10:25,128 INFO L93 Difference]: Finished difference Result 4412 states and 9625 transitions. [2019-12-18 18:10:25,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 18:10:25,129 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-18 18:10:25,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:10:25,141 INFO L225 Difference]: With dead ends: 4412 [2019-12-18 18:10:25,141 INFO L226 Difference]: Without dead ends: 4383 [2019-12-18 18:10:25,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:10:25,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4383 states. [2019-12-18 18:10:25,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4383 to 2070. [2019-12-18 18:10:25,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2070 states. [2019-12-18 18:10:25,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 4705 transitions. [2019-12-18 18:10:25,194 INFO L78 Accepts]: Start accepts. Automaton has 2070 states and 4705 transitions. Word has length 26 [2019-12-18 18:10:25,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:10:25,194 INFO L462 AbstractCegarLoop]: Abstraction has 2070 states and 4705 transitions. [2019-12-18 18:10:25,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:10:25,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 4705 transitions. [2019-12-18 18:10:25,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 18:10:25,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:10:25,198 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-18 18:10:25,198 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:10:25,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:10:25,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1827812304, now seen corresponding path program 1 times [2019-12-18 18:10:25,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:10:25,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571783699] [2019-12-18 18:10:25,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:10:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:10:25,298 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-18 18:10:25,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571783699] [2019-12-18 18:10:25,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:10:25,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:10:25,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398005911] [2019-12-18 18:10:25,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:10:25,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:10:25,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:10:25,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:10:25,301 INFO L87 Difference]: Start difference. First operand 2070 states and 4705 transitions. Second operand 5 states. [2019-12-18 18:10:25,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:10:25,814 INFO L93 Difference]: Finished difference Result 3102 states and 6886 transitions. [2019-12-18 18:10:25,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:10:25,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 18:10:25,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:10:25,823 INFO L225 Difference]: With dead ends: 3102 [2019-12-18 18:10:25,823 INFO L226 Difference]: Without dead ends: 3102 [2019-12-18 18:10:25,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:10:25,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3102 states. [2019-12-18 18:10:25,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3102 to 2654. [2019-12-18 18:10:25,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2654 states. [2019-12-18 18:10:25,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2654 states and 5970 transitions. [2019-12-18 18:10:25,874 INFO L78 Accepts]: Start accepts. Automaton has 2654 states and 5970 transitions. Word has length 27 [2019-12-18 18:10:25,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:10:25,875 INFO L462 AbstractCegarLoop]: Abstraction has 2654 states and 5970 transitions. [2019-12-18 18:10:25,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:10:25,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2654 states and 5970 transitions. [2019-12-18 18:10:25,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 18:10:25,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:10:25,881 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-18 18:10:25,881 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:10:25,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:10:25,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1234551102, now seen corresponding path program 1 times [2019-12-18 18:10:25,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:10:25,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325249118] [2019-12-18 18:10:25,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:10:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:10:25,958 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-18 18:10:25,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325249118] [2019-12-18 18:10:25,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:10:25,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:10:25,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12925062] [2019-12-18 18:10:25,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:10:25,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:10:25,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:10:25,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:10:25,961 INFO L87 Difference]: Start difference. First operand 2654 states and 5970 transitions. Second operand 5 states. [2019-12-18 18:10:26,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:10:26,004 INFO L93 Difference]: Finished difference Result 1623 states and 3504 transitions. [2019-12-18 18:10:26,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:10:26,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 18:10:26,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:10:26,007 INFO L225 Difference]: With dead ends: 1623 [2019-12-18 18:10:26,007 INFO L226 Difference]: Without dead ends: 1475 [2019-12-18 18:10:26,008 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-18 18:10:26,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2019-12-18 18:10:26,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1374. [2019-12-18 18:10:26,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1374 states. [2019-12-18 18:10:26,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2999 transitions. [2019-12-18 18:10:26,032 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2999 transitions. Word has length 28 [2019-12-18 18:10:26,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:10:26,032 INFO L462 AbstractCegarLoop]: Abstraction has 1374 states and 2999 transitions. [2019-12-18 18:10:26,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:10:26,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2999 transitions. [2019-12-18 18:10:26,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 18:10:26,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:10:26,039 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-18 18:10:26,039 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:10:26,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:10:26,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1528690992, now seen corresponding path program 1 times [2019-12-18 18:10:26,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:10:26,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219906352] [2019-12-18 18:10:26,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:10:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:10:26,184 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-18 18:10:26,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219906352] [2019-12-18 18:10:26,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:10:26,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:10:26,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369514787] [2019-12-18 18:10:26,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:10:26,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:10:26,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:10:26,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:10:26,187 INFO L87 Difference]: Start difference. First operand 1374 states and 2999 transitions. Second operand 7 states. [2019-12-18 18:10:26,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:10:26,536 INFO L93 Difference]: Finished difference Result 4064 states and 8639 transitions. [2019-12-18 18:10:26,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 18:10:26,537 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 18:10:26,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:10:26,542 INFO L225 Difference]: With dead ends: 4064 [2019-12-18 18:10:26,542 INFO L226 Difference]: Without dead ends: 2676 [2019-12-18 18:10:26,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 18:10:26,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2019-12-18 18:10:26,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 1440. [2019-12-18 18:10:26,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1440 states. [2019-12-18 18:10:26,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 3133 transitions. [2019-12-18 18:10:26,571 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 3133 transitions. Word has length 51 [2019-12-18 18:10:26,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:10:26,571 INFO L462 AbstractCegarLoop]: Abstraction has 1440 states and 3133 transitions. [2019-12-18 18:10:26,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:10:26,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 3133 transitions. [2019-12-18 18:10:26,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 18:10:26,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:10:26,576 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-18 18:10:26,576 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:10:26,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:10:26,577 INFO L82 PathProgramCache]: Analyzing trace with hash 517037056, now seen corresponding path program 2 times [2019-12-18 18:10:26,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:10:26,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046760345] [2019-12-18 18:10:26,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:10:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:10:26,715 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-18 18:10:26,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046760345] [2019-12-18 18:10:26,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:10:26,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:10:26,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866804977] [2019-12-18 18:10:26,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:10:26,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:10:26,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:10:26,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:10:26,718 INFO L87 Difference]: Start difference. First operand 1440 states and 3133 transitions. Second operand 3 states. [2019-12-18 18:10:26,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:10:26,772 INFO L93 Difference]: Finished difference Result 1866 states and 4011 transitions. [2019-12-18 18:10:26,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:10:26,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 18:10:26,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:10:26,779 INFO L225 Difference]: With dead ends: 1866 [2019-12-18 18:10:26,779 INFO L226 Difference]: Without dead ends: 1866 [2019-12-18 18:10:26,779 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-18 18:10:26,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2019-12-18 18:10:26,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1519. [2019-12-18 18:10:26,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1519 states. [2019-12-18 18:10:26,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 3317 transitions. [2019-12-18 18:10:26,804 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 3317 transitions. Word has length 51 [2019-12-18 18:10:26,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:10:26,805 INFO L462 AbstractCegarLoop]: Abstraction has 1519 states and 3317 transitions. [2019-12-18 18:10:26,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:10:26,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 3317 transitions. [2019-12-18 18:10:26,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 18:10:26,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:10:26,810 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-18 18:10:26,810 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:10:26,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:10:26,810 INFO L82 PathProgramCache]: Analyzing trace with hash -975275625, now seen corresponding path program 1 times [2019-12-18 18:10:26,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:10:26,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199046954] [2019-12-18 18:10:26,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:10:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:10:26,923 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-18 18:10:26,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199046954] [2019-12-18 18:10:26,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:10:26,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:10:26,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611760278] [2019-12-18 18:10:26,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:10:26,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:10:26,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:10:26,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:10:26,925 INFO L87 Difference]: Start difference. First operand 1519 states and 3317 transitions. Second operand 3 states. [2019-12-18 18:10:26,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:10:26,942 INFO L93 Difference]: Finished difference Result 1518 states and 3315 transitions. [2019-12-18 18:10:26,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:10:26,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 18:10:26,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:10:26,945 INFO L225 Difference]: With dead ends: 1518 [2019-12-18 18:10:26,945 INFO L226 Difference]: Without dead ends: 1518 [2019-12-18 18:10:26,946 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-18 18:10:26,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2019-12-18 18:10:26,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1102. [2019-12-18 18:10:26,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1102 states. [2019-12-18 18:10:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 2419 transitions. [2019-12-18 18:10:26,965 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 2419 transitions. Word has length 52 [2019-12-18 18:10:26,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:10:26,965 INFO L462 AbstractCegarLoop]: Abstraction has 1102 states and 2419 transitions. [2019-12-18 18:10:26,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:10:26,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 2419 transitions. [2019-12-18 18:10:26,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:10:26,968 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:10:26,969 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, 1] [2019-12-18 18:10:26,969 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:10:26,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:10:26,969 INFO L82 PathProgramCache]: Analyzing trace with hash 238171223, now seen corresponding path program 1 times [2019-12-18 18:10:26,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:10:26,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978256823] [2019-12-18 18:10:26,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:10:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:10:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:10:27,138 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 18:10:27,138 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 18:10:27,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~x$r_buff1_thd1~0_165 0) (= 0 v_~x~0_148) (= v_~x$r_buff0_thd0~0_133 0) (= v_~x$r_buff0_thd1~0_227 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1715~0.base_24| 4)) (= v_~weak$$choice2~0_120 0) (= |v_#NULL.offset_6| 0) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t1715~0.base_24| 1)) (= 0 |v_ULTIMATE.start_main_~#t1715~0.offset_18|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1715~0.base_24| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1715~0.base_24|) |v_ULTIMATE.start_main_~#t1715~0.offset_18| 0)) |v_#memory_int_13|) (= v_~__unbuffered_p1_EBX~0_40 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_63) (= v_~main$tmp_guard1~0_41 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1715~0.base_24|) (= v_~y~0_147 0) (= 0 |v_#NULL.base_6|) (= v_~x$flush_delayed~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_24 0) (= 0 v_~x$w_buff1_used~0_507) (= 0 v_~weak$$choice0~0_22) (= v_~x$r_buff1_thd0~0_183 0) (= 0 v_~x$w_buff1~0_317) (= 0 v_~x$w_buff0~0_542) (= 0 v_~x$r_buff0_thd2~0_359) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1715~0.base_24|)) (= 0 v_~x$w_buff0_used~0_792) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~x$r_buff1_thd2~0_331) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_542, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_227, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ULTIMATE.start_main_~#t1715~0.offset=|v_ULTIMATE.start_main_~#t1715~0.offset_18|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, #length=|v_#length_13|, ~y~0=v_~y~0_147, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_133, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ULTIMATE.start_main_~#t1716~0.offset=|v_ULTIMATE.start_main_~#t1716~0.offset_14|, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_507, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_331, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_359, ULTIMATE.start_main_~#t1716~0.base=|v_ULTIMATE.start_main_~#t1716~0.base_16|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_792, ~weak$$choice0~0=v_~weak$$choice0~0_22, ULTIMATE.start_main_~#t1715~0.base=|v_ULTIMATE.start_main_~#t1715~0.base_24|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~x~0=v_~x~0_148, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1715~0.offset, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1716~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t1716~0.base, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1715~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 18:10:27,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= 1 v_~x$r_buff0_thd1~0_40) (= v_~x$r_buff1_thd1~0_23 v_~x$r_buff0_thd1~0_41) (= v_~x$r_buff1_thd2~0_64 v_~x$r_buff0_thd2~0_110) (= v_~y~0_18 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74 0)) (= v_~x$r_buff1_thd0~0_37 v_~x$r_buff0_thd0~0_53)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~y~0=v_~y~0_18, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_37} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 18:10:27,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-1-->L799: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1716~0.base_12| 0)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1716~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t1716~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1716~0.base_12|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1716~0.base_12| 4)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1716~0.base_12| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1716~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1716~0.base_12|) |v_ULTIMATE.start_main_~#t1716~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1716~0.offset=|v_ULTIMATE.start_main_~#t1716~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1716~0.base=|v_ULTIMATE.start_main_~#t1716~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1716~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1716~0.base] because there is no mapped edge [2019-12-18 18:10:27,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In2134755996 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In2134755996 256)))) (or (and (= ~x$w_buff0_used~0_In2134755996 |P0Thread1of1ForFork0_#t~ite5_Out2134755996|) (or .cse0 .cse1)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out2134755996| 0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2134755996, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2134755996} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out2134755996|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2134755996, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2134755996} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 18:10:27,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-951463160 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-951463160| |P1Thread1of1ForFork1_#t~ite15_Out-951463160|) (= |P1Thread1of1ForFork1_#t~ite14_Out-951463160| ~x$w_buff0~0_In-951463160) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-951463160 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-951463160 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-951463160 256)) (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-951463160 256)))))) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In-951463160| |P1Thread1of1ForFork1_#t~ite14_Out-951463160|) (= |P1Thread1of1ForFork1_#t~ite15_Out-951463160| ~x$w_buff0~0_In-951463160)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-951463160, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-951463160, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-951463160, ~weak$$choice2~0=~weak$$choice2~0_In-951463160, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-951463160, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-951463160|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-951463160} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-951463160, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-951463160, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-951463160, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-951463160|, ~weak$$choice2~0=~weak$$choice2~0_In-951463160, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-951463160, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-951463160|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-951463160} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 18:10:27,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd1~0_In-829372023 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-829372023 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-829372023 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-829372023 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-829372023| ~x$w_buff1_used~0_In-829372023) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-829372023| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-829372023, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-829372023, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-829372023, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-829372023} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-829372023|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-829372023, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-829372023, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-829372023, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-829372023} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 18:10:27,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1104147123 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1104147123 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd1~0_In-1104147123 ~x$r_buff0_thd1~0_Out-1104147123)) (and (= ~x$r_buff0_thd1~0_Out-1104147123 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1104147123, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1104147123} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-1104147123, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1104147123|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1104147123} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 18:10:27,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd1~0_In-1140359586 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1140359586 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1140359586 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-1140359586 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1140359586| ~x$r_buff1_thd1~0_In-1140359586) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1140359586| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1140359586, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1140359586, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1140359586, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1140359586} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1140359586, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1140359586|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1140359586, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1140359586, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1140359586} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 18:10:27,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd1~0_128 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_128} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 18:10:27,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1497831547 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite17_In-1497831547| |P1Thread1of1ForFork1_#t~ite17_Out-1497831547|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite18_Out-1497831547| ~x$w_buff1~0_In-1497831547)) (and (= ~x$w_buff1~0_In-1497831547 |P1Thread1of1ForFork1_#t~ite17_Out-1497831547|) (= |P1Thread1of1ForFork1_#t~ite18_Out-1497831547| |P1Thread1of1ForFork1_#t~ite17_Out-1497831547|) (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1497831547 256) 0))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-1497831547 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-1497831547 256)) (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1497831547 256))))) .cse0))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1497831547, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1497831547, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1497831547, ~weak$$choice2~0=~weak$$choice2~0_In-1497831547, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1497831547, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-1497831547|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1497831547} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-1497831547|, ~x$w_buff1~0=~x$w_buff1~0_In-1497831547, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1497831547, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1497831547, ~weak$$choice2~0=~weak$$choice2~0_In-1497831547, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1497831547, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-1497831547|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1497831547} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-18 18:10:27,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In115933305 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In115933305| |P1Thread1of1ForFork1_#t~ite20_Out115933305|) (= |P1Thread1of1ForFork1_#t~ite21_Out115933305| ~x$w_buff0_used~0_In115933305)) (and (= |P1Thread1of1ForFork1_#t~ite21_Out115933305| |P1Thread1of1ForFork1_#t~ite20_Out115933305|) (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In115933305 256) 0))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In115933305 256))) (= (mod ~x$w_buff0_used~0_In115933305 256) 0) (and (= (mod ~x$w_buff1_used~0_In115933305 256) 0) .cse1))) (= |P1Thread1of1ForFork1_#t~ite20_Out115933305| ~x$w_buff0_used~0_In115933305) .cse0))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In115933305|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In115933305, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In115933305, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In115933305, ~weak$$choice2~0=~weak$$choice2~0_In115933305, ~x$w_buff0_used~0=~x$w_buff0_used~0_In115933305} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out115933305|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In115933305, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In115933305, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out115933305|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In115933305, ~weak$$choice2~0=~weak$$choice2~0_In115933305, ~x$w_buff0_used~0=~x$w_buff0_used~0_In115933305} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 18:10:27,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd2~0_135 v_~x$r_buff0_thd2~0_134)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_27, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_14|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 18:10:27,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1829988438 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In1829988438| |P1Thread1of1ForFork1_#t~ite29_Out1829988438|) (= ~x$r_buff1_thd2~0_In1829988438 |P1Thread1of1ForFork1_#t~ite30_Out1829988438|)) (and (= ~x$r_buff1_thd2~0_In1829988438 |P1Thread1of1ForFork1_#t~ite29_Out1829988438|) (= |P1Thread1of1ForFork1_#t~ite30_Out1829988438| |P1Thread1of1ForFork1_#t~ite29_Out1829988438|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1829988438 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In1829988438 256)) (and (= (mod ~x$w_buff1_used~0_In1829988438 256) 0) .cse1) (and (= 0 (mod ~x$r_buff1_thd2~0_In1829988438 256)) .cse1)))))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1829988438|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1829988438, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1829988438, ~weak$$choice2~0=~weak$$choice2~0_In1829988438, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1829988438, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1829988438} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1829988438|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1829988438|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1829988438, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1829988438, ~weak$$choice2~0=~weak$$choice2~0_In1829988438, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1829988438, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1829988438} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 18:10:27,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-18 18:10:27,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-59364986 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-59364986 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out-59364986| ~x$w_buff1~0_In-59364986) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out-59364986| ~x~0_In-59364986) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-59364986, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-59364986, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-59364986, ~x~0=~x~0_In-59364986} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-59364986, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-59364986, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-59364986, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-59364986|, ~x~0=~x~0_In-59364986} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 18:10:27,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_29 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 18:10:27,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-1100765108 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1100765108 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1100765108|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-1100765108 |P1Thread1of1ForFork1_#t~ite34_Out-1100765108|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1100765108, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1100765108} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1100765108|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1100765108, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1100765108} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 18:10:27,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd2~0_In452010449 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In452010449 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In452010449 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In452010449 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite35_Out452010449| ~x$w_buff1_used~0_In452010449) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out452010449|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In452010449, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In452010449, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In452010449, ~x$w_buff0_used~0=~x$w_buff0_used~0_In452010449} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In452010449, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In452010449, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out452010449|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In452010449, ~x$w_buff0_used~0=~x$w_buff0_used~0_In452010449} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 18:10:27,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In250651665 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In250651665 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out250651665|) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In250651665 |P1Thread1of1ForFork1_#t~ite36_Out250651665|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In250651665, ~x$w_buff0_used~0=~x$w_buff0_used~0_In250651665} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In250651665, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out250651665|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In250651665} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 18:10:27,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In1172955621 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In1172955621 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1172955621 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1172955621 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out1172955621| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite37_Out1172955621| ~x$r_buff1_thd2~0_In1172955621)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1172955621, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1172955621, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1172955621, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1172955621} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1172955621, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1172955621, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1172955621, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1172955621|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1172955621} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 18:10:27,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_269 |v_P1Thread1of1ForFork1_#t~ite37_42|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_42|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_269, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_41|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 18:10:27,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_64 256)) (= (mod v_~x$w_buff0_used~0_301 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 18:10:27,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In121360787 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In121360787 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out121360787| ~x~0_In121360787)) (and (not .cse1) (= ~x$w_buff1~0_In121360787 |ULTIMATE.start_main_#t~ite40_Out121360787|) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In121360787, ~x$w_buff1_used~0=~x$w_buff1_used~0_In121360787, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In121360787, ~x~0=~x~0_In121360787} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out121360787|, ~x$w_buff1~0=~x$w_buff1~0_In121360787, ~x$w_buff1_used~0=~x$w_buff1_used~0_In121360787, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In121360787, ~x~0=~x~0_In121360787} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 18:10:27,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_46 |v_ULTIMATE.start_main_#t~ite40_13|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~x~0=v_~x~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-18 18:10:27,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In2133562433 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In2133562433 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out2133562433| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite42_Out2133562433| ~x$w_buff0_used~0_In2133562433)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2133562433, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2133562433} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2133562433, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out2133562433|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2133562433} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 18:10:27,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-273054006 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-273054006 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-273054006 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-273054006 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-273054006 |ULTIMATE.start_main_#t~ite43_Out-273054006|)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-273054006|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-273054006, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-273054006, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-273054006, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-273054006} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-273054006, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-273054006, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-273054006|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-273054006, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-273054006} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 18:10:27,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In805792249 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In805792249 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out805792249|)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In805792249 |ULTIMATE.start_main_#t~ite44_Out805792249|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In805792249, ~x$w_buff0_used~0=~x$w_buff0_used~0_In805792249} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In805792249, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out805792249|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In805792249} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 18:10:27,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-886376789 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-886376789 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-886376789 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-886376789 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out-886376789| ~x$r_buff1_thd0~0_In-886376789)) (and (= |ULTIMATE.start_main_#t~ite45_Out-886376789| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-886376789, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-886376789, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-886376789, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-886376789} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-886376789, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-886376789, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-886376789, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-886376789|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-886376789} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 18:10:27,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~main$tmp_guard1~0_20 0) (= v_~y~0_126 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= 2 v_~__unbuffered_p1_EAX~0_27) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite45_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y~0=v_~y~0_126, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_126, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, 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, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 18:10:27,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:10:27 BasicIcfg [2019-12-18 18:10:27,254 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:10:27,256 INFO L168 Benchmark]: Toolchain (without parser) took 16754.37 ms. Allocated memory was 138.4 MB in the beginning and 692.6 MB in the end (delta: 554.2 MB). Free memory was 102.2 MB in the beginning and 412.8 MB in the end (delta: -310.6 MB). Peak memory consumption was 243.5 MB. Max. memory is 7.1 GB. [2019-12-18 18:10:27,257 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 18:10:27,258 INFO L168 Benchmark]: CACSL2BoogieTranslator took 744.41 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.7 MB in the beginning and 158.6 MB in the end (delta: -56.9 MB). Peak memory consumption was 28.0 MB. Max. memory is 7.1 GB. [2019-12-18 18:10:27,259 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.27 ms. Allocated memory is still 202.9 MB. Free memory was 158.6 MB in the beginning and 155.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 18:10:27,259 INFO L168 Benchmark]: Boogie Preprocessor took 40.36 ms. Allocated memory is still 202.9 MB. Free memory was 155.8 MB in the beginning and 153.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 18:10:27,260 INFO L168 Benchmark]: RCFGBuilder took 762.39 ms. Allocated memory is still 202.9 MB. Free memory was 153.8 MB in the beginning and 109.5 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2019-12-18 18:10:27,261 INFO L168 Benchmark]: TraceAbstraction took 15139.21 ms. Allocated memory was 202.9 MB in the beginning and 692.6 MB in the end (delta: 489.7 MB). Free memory was 108.8 MB in the beginning and 412.8 MB in the end (delta: -303.9 MB). Peak memory consumption was 185.7 MB. Max. memory is 7.1 GB. [2019-12-18 18:10:27,265 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.39 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 744.41 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.7 MB in the beginning and 158.6 MB in the end (delta: -56.9 MB). Peak memory consumption was 28.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.27 ms. Allocated memory is still 202.9 MB. Free memory was 158.6 MB in the beginning and 155.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.36 ms. Allocated memory is still 202.9 MB. Free memory was 155.8 MB in the beginning and 153.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 762.39 ms. Allocated memory is still 202.9 MB. Free memory was 153.8 MB in the beginning and 109.5 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15139.21 ms. Allocated memory was 202.9 MB in the beginning and 692.6 MB in the end (delta: 489.7 MB). Free memory was 108.8 MB in the beginning and 412.8 MB in the end (delta: -303.9 MB). Peak memory consumption was 185.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 147 ProgramPointsBefore, 79 ProgramPointsAfterwards, 181 TransitionsBefore, 90 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 29 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 26 ChoiceCompositions, 4894 VarBasedMoverChecksPositive, 354 VarBasedMoverChecksNegative, 269 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 76691 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t1715, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 x$w_buff1 = x$w_buff0 [L725] 1 x$w_buff0 = 1 [L726] 1 x$w_buff1_used = x$w_buff0_used [L727] 1 x$w_buff0_used = (_Bool)1 [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] FCALL, FORK 0 pthread_create(&t1716, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L752] 2 y = 2 [L755] 2 __unbuffered_p1_EAX = y [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 x$flush_delayed = weak$$choice2 [L761] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L762] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L763] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L764] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L765] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.8s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1689 SDtfs, 1747 SDslu, 3197 SDs, 0 SdLazy, 1679 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 14 SyntacticMatches, 9 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12234occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 9967 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 374 NumberOfCodeBlocks, 374 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 309 ConstructedInterpolants, 0 QuantifiedInterpolants, 37955 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...