/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:13:43,150 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:13:43,153 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:13:43,167 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:13:43,167 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:13:43,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:13:43,170 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:13:43,171 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:13:43,173 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:13:43,174 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:13:43,175 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:13:43,176 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:13:43,177 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:13:43,177 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:13:43,178 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:13:43,179 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:13:43,180 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:13:43,181 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:13:43,183 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:13:43,185 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:13:43,187 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:13:43,188 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:13:43,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:13:43,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:13:43,192 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:13:43,192 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:13:43,192 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:13:43,193 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:13:43,194 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:13:43,195 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:13:43,195 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:13:43,196 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:13:43,196 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:13:43,197 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:13:43,198 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:13:43,198 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:13:43,199 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:13:43,199 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:13:43,199 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:13:43,200 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:13:43,201 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:13:43,202 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 14:13:43,217 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:13:43,217 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:13:43,221 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:13:43,221 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:13:43,221 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:13:43,221 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:13:43,221 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:13:43,222 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:13:43,222 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:13:43,222 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:13:43,222 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:13:43,222 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:13:43,223 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:13:43,224 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:13:43,224 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:13:43,224 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:13:43,224 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:13:43,224 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:13:43,224 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:13:43,225 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:13:43,225 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:13:43,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:13:43,226 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:13:43,226 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:13:43,226 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:13:43,226 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:13:43,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:13:43,226 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:13:43,227 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:13:43,227 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:13:43,498 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:13:43,508 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:13:43,517 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:13:43,518 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:13:43,519 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:13:43,519 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc.i [2019-12-18 14:13:43,597 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bc028003/6903b21ffc634160a5c7b555bb977455/FLAG38e070bc2 [2019-12-18 14:13:44,192 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:13:44,193 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc.i [2019-12-18 14:13:44,217 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bc028003/6903b21ffc634160a5c7b555bb977455/FLAG38e070bc2 [2019-12-18 14:13:44,408 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bc028003/6903b21ffc634160a5c7b555bb977455 [2019-12-18 14:13:44,417 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:13:44,419 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:13:44,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:13:44,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:13:44,423 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:13:44,425 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:13:44" (1/1) ... [2019-12-18 14:13:44,427 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23f83c07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:13:44, skipping insertion in model container [2019-12-18 14:13:44,428 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:13:44" (1/1) ... [2019-12-18 14:13:44,435 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:13:44,494 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:13:45,174 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:13:45,188 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:13:45,258 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:13:45,329 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:13:45,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:13:45 WrapperNode [2019-12-18 14:13:45,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:13:45,331 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:13:45,331 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:13:45,331 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:13:45,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:13:45" (1/1) ... [2019-12-18 14:13:45,368 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:13:45" (1/1) ... [2019-12-18 14:13:45,400 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:13:45,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:13:45,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:13:45,401 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:13:45,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:13:45" (1/1) ... [2019-12-18 14:13:45,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:13:45" (1/1) ... [2019-12-18 14:13:45,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:13:45" (1/1) ... [2019-12-18 14:13:45,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:13:45" (1/1) ... [2019-12-18 14:13:45,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:13:45" (1/1) ... [2019-12-18 14:13:45,429 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:13:45" (1/1) ... [2019-12-18 14:13:45,433 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:13:45" (1/1) ... [2019-12-18 14:13:45,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:13:45,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:13:45,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:13:45,439 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:13:45,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:13:45" (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 14:13:45,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:13:45,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:13:45,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:13:45,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:13:45,513 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:13:45,513 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:13:45,513 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:13:45,513 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:13:45,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:13:45,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:13:45,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:13:45,517 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 14:13:46,191 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:13:46,192 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:13:46,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:13:46 BoogieIcfgContainer [2019-12-18 14:13:46,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:13:46,195 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:13:46,196 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:13:46,199 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:13:46,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:13:44" (1/3) ... [2019-12-18 14:13:46,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e9492b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:13:46, skipping insertion in model container [2019-12-18 14:13:46,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:13:45" (2/3) ... [2019-12-18 14:13:46,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e9492b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:13:46, skipping insertion in model container [2019-12-18 14:13:46,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:13:46" (3/3) ... [2019-12-18 14:13:46,207 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_power.oepc.i [2019-12-18 14:13:46,216 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:13:46,216 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:13:46,223 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:13:46,224 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:13:46,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,263 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,263 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,263 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,264 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,264 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,274 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,275 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,323 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,323 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,323 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,329 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,332 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:13:46,347 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 14:13:46,367 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:13:46,367 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:13:46,367 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:13:46,367 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:13:46,367 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:13:46,367 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:13:46,367 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:13:46,368 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:13:46,384 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-18 14:13:46,386 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 14:13:46,464 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 14:13:46,464 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:13:46,479 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 14:13:46,501 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 14:13:46,582 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 14:13:46,582 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:13:46,590 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 14:13:46,606 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 14:13:46,607 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:13:51,361 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 14:13:51,469 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 14:13:51,839 INFO L206 etLargeBlockEncoding]: Checked pairs total: 76691 [2019-12-18 14:13:51,839 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-18 14:13:51,843 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 90 transitions [2019-12-18 14:13:52,457 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9438 states. [2019-12-18 14:13:52,460 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states. [2019-12-18 14:13:52,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 14:13:52,467 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:13:52,468 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 14:13:52,469 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:13:52,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:13:52,477 INFO L82 PathProgramCache]: Analyzing trace with hash 790297, now seen corresponding path program 1 times [2019-12-18 14:13:52,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:13:52,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670540400] [2019-12-18 14:13:52,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:13:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:13:52,693 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 14:13:52,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670540400] [2019-12-18 14:13:52,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:13:52,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:13:52,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561618194] [2019-12-18 14:13:52,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:13:52,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:13:52,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:13:52,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:13:52,720 INFO L87 Difference]: Start difference. First operand 9438 states. Second operand 3 states. [2019-12-18 14:13:52,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:13:52,975 INFO L93 Difference]: Finished difference Result 9266 states and 29920 transitions. [2019-12-18 14:13:52,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:13:52,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 14:13:52,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:13:53,105 INFO L225 Difference]: With dead ends: 9266 [2019-12-18 14:13:53,105 INFO L226 Difference]: Without dead ends: 8258 [2019-12-18 14:13:53,106 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 14:13:53,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8258 states. [2019-12-18 14:13:53,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8258 to 8258. [2019-12-18 14:13:53,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8258 states. [2019-12-18 14:13:53,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8258 states to 8258 states and 26572 transitions. [2019-12-18 14:13:53,600 INFO L78 Accepts]: Start accepts. Automaton has 8258 states and 26572 transitions. Word has length 3 [2019-12-18 14:13:53,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:13:53,601 INFO L462 AbstractCegarLoop]: Abstraction has 8258 states and 26572 transitions. [2019-12-18 14:13:53,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:13:53,601 INFO L276 IsEmpty]: Start isEmpty. Operand 8258 states and 26572 transitions. [2019-12-18 14:13:53,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:13:53,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:13:53,604 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:13:53,605 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:13:53,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:13:53,605 INFO L82 PathProgramCache]: Analyzing trace with hash 316025548, now seen corresponding path program 1 times [2019-12-18 14:13:53,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:13:53,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982278495] [2019-12-18 14:13:53,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:13:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:13:53,747 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 14:13:53,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982278495] [2019-12-18 14:13:53,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:13:53,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:13:53,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536406858] [2019-12-18 14:13:53,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:13:53,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:13:53,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:13:53,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:13:53,751 INFO L87 Difference]: Start difference. First operand 8258 states and 26572 transitions. Second operand 4 states. [2019-12-18 14:13:54,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:13:54,183 INFO L93 Difference]: Finished difference Result 12603 states and 38772 transitions. [2019-12-18 14:13:54,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:13:54,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:13:54,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:13:54,255 INFO L225 Difference]: With dead ends: 12603 [2019-12-18 14:13:54,256 INFO L226 Difference]: Without dead ends: 12589 [2019-12-18 14:13:54,256 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 14:13:54,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12589 states. [2019-12-18 14:13:55,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12589 to 11299. [2019-12-18 14:13:55,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11299 states. [2019-12-18 14:13:55,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11299 states to 11299 states and 35365 transitions. [2019-12-18 14:13:55,254 INFO L78 Accepts]: Start accepts. Automaton has 11299 states and 35365 transitions. Word has length 11 [2019-12-18 14:13:55,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:13:55,254 INFO L462 AbstractCegarLoop]: Abstraction has 11299 states and 35365 transitions. [2019-12-18 14:13:55,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:13:55,254 INFO L276 IsEmpty]: Start isEmpty. Operand 11299 states and 35365 transitions. [2019-12-18 14:13:55,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:13:55,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:13:55,259 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:13:55,260 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:13:55,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:13:55,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1209477957, now seen corresponding path program 1 times [2019-12-18 14:13:55,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:13:55,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592568842] [2019-12-18 14:13:55,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:13:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:13:55,347 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 14:13:55,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592568842] [2019-12-18 14:13:55,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:13:55,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:13:55,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226817144] [2019-12-18 14:13:55,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:13:55,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:13:55,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:13:55,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:13:55,349 INFO L87 Difference]: Start difference. First operand 11299 states and 35365 transitions. Second operand 4 states. [2019-12-18 14:13:55,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:13:55,586 INFO L93 Difference]: Finished difference Result 13736 states and 42816 transitions. [2019-12-18 14:13:55,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:13:55,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 14:13:55,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:13:55,641 INFO L225 Difference]: With dead ends: 13736 [2019-12-18 14:13:55,642 INFO L226 Difference]: Without dead ends: 13736 [2019-12-18 14:13:55,642 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 14:13:55,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13736 states. [2019-12-18 14:13:56,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13736 to 12234. [2019-12-18 14:13:56,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12234 states. [2019-12-18 14:13:56,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12234 states to 12234 states and 38359 transitions. [2019-12-18 14:13:56,170 INFO L78 Accepts]: Start accepts. Automaton has 12234 states and 38359 transitions. Word has length 14 [2019-12-18 14:13:56,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:13:56,171 INFO L462 AbstractCegarLoop]: Abstraction has 12234 states and 38359 transitions. [2019-12-18 14:13:56,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:13:56,172 INFO L276 IsEmpty]: Start isEmpty. Operand 12234 states and 38359 transitions. [2019-12-18 14:13:56,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 14:13:56,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:13:56,176 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:13:56,176 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:13:56,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:13:56,176 INFO L82 PathProgramCache]: Analyzing trace with hash -572907870, now seen corresponding path program 1 times [2019-12-18 14:13:56,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:13:56,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789424165] [2019-12-18 14:13:56,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:13:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:13:56,226 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 14:13:56,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789424165] [2019-12-18 14:13:56,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:13:56,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:13:56,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843900087] [2019-12-18 14:13:56,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:13:56,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:13:56,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:13:56,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:13:56,228 INFO L87 Difference]: Start difference. First operand 12234 states and 38359 transitions. Second operand 3 states. [2019-12-18 14:13:56,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:13:56,283 INFO L93 Difference]: Finished difference Result 12209 states and 38285 transitions. [2019-12-18 14:13:56,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:13:56,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 14:13:56,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:13:56,321 INFO L225 Difference]: With dead ends: 12209 [2019-12-18 14:13:56,321 INFO L226 Difference]: Without dead ends: 12209 [2019-12-18 14:13:56,322 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 14:13:56,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12209 states. [2019-12-18 14:13:56,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12209 to 12209. [2019-12-18 14:13:56,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12209 states. [2019-12-18 14:13:56,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12209 states to 12209 states and 38285 transitions. [2019-12-18 14:13:56,691 INFO L78 Accepts]: Start accepts. Automaton has 12209 states and 38285 transitions. Word has length 16 [2019-12-18 14:13:56,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:13:56,691 INFO L462 AbstractCegarLoop]: Abstraction has 12209 states and 38285 transitions. [2019-12-18 14:13:56,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:13:56,691 INFO L276 IsEmpty]: Start isEmpty. Operand 12209 states and 38285 transitions. [2019-12-18 14:13:56,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 14:13:56,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:13:56,696 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 14:13:56,696 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:13:56,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:13:56,696 INFO L82 PathProgramCache]: Analyzing trace with hash -574911552, now seen corresponding path program 1 times [2019-12-18 14:13:56,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:13:56,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364015295] [2019-12-18 14:13:56,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:13:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:13:56,775 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 14:13:56,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364015295] [2019-12-18 14:13:56,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:13:56,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:13:56,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476152011] [2019-12-18 14:13:56,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:13:56,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:13:56,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:13:56,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:13:56,778 INFO L87 Difference]: Start difference. First operand 12209 states and 38285 transitions. Second operand 4 states. [2019-12-18 14:13:56,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:13:56,812 INFO L93 Difference]: Finished difference Result 2335 states and 5845 transitions. [2019-12-18 14:13:56,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:13:56,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 14:13:56,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:13:56,816 INFO L225 Difference]: With dead ends: 2335 [2019-12-18 14:13:56,816 INFO L226 Difference]: Without dead ends: 1651 [2019-12-18 14:13:56,817 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 14:13:56,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2019-12-18 14:13:56,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1635. [2019-12-18 14:13:56,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1635 states. [2019-12-18 14:13:56,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 3657 transitions. [2019-12-18 14:13:56,852 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 3657 transitions. Word has length 17 [2019-12-18 14:13:56,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:13:56,853 INFO L462 AbstractCegarLoop]: Abstraction has 1635 states and 3657 transitions. [2019-12-18 14:13:56,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:13:56,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 3657 transitions. [2019-12-18 14:13:57,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:13:57,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:13:57,015 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 14:13:57,015 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:13:57,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:13:57,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1133745070, now seen corresponding path program 1 times [2019-12-18 14:13:57,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:13:57,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970366531] [2019-12-18 14:13:57,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:13:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:13:57,140 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 14:13:57,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970366531] [2019-12-18 14:13:57,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:13:57,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:13:57,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548346953] [2019-12-18 14:13:57,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:13:57,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:13:57,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:13:57,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:13:57,143 INFO L87 Difference]: Start difference. First operand 1635 states and 3657 transitions. Second operand 6 states. [2019-12-18 14:13:57,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:13:57,750 INFO L93 Difference]: Finished difference Result 4528 states and 9998 transitions. [2019-12-18 14:13:57,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:13:57,751 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 14:13:57,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:13:57,765 INFO L225 Difference]: With dead ends: 4528 [2019-12-18 14:13:57,766 INFO L226 Difference]: Without dead ends: 4493 [2019-12-18 14:13:57,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:13:57,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4493 states. [2019-12-18 14:13:57,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4493 to 2195. [2019-12-18 14:13:57,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2195 states. [2019-12-18 14:13:57,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 2195 states and 4961 transitions. [2019-12-18 14:13:57,819 INFO L78 Accepts]: Start accepts. Automaton has 2195 states and 4961 transitions. Word has length 25 [2019-12-18 14:13:57,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:13:57,820 INFO L462 AbstractCegarLoop]: Abstraction has 2195 states and 4961 transitions. [2019-12-18 14:13:57,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:13:57,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2195 states and 4961 transitions. [2019-12-18 14:13:57,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 14:13:57,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:13:57,826 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:13:57,826 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:13:57,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:13:57,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1963896570, now seen corresponding path program 1 times [2019-12-18 14:13:57,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:13:57,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743520757] [2019-12-18 14:13:57,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:13:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:13:57,972 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 14:13:57,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743520757] [2019-12-18 14:13:57,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:13:57,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:13:57,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053024785] [2019-12-18 14:13:57,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:13:57,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:13:57,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:13:57,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:13:57,974 INFO L87 Difference]: Start difference. First operand 2195 states and 4961 transitions. Second operand 6 states. [2019-12-18 14:13:58,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:13:58,520 INFO L93 Difference]: Finished difference Result 4412 states and 9625 transitions. [2019-12-18 14:13:58,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:13:58,520 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-18 14:13:58,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:13:58,528 INFO L225 Difference]: With dead ends: 4412 [2019-12-18 14:13:58,528 INFO L226 Difference]: Without dead ends: 4383 [2019-12-18 14:13:58,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 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 14:13:58,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4383 states. [2019-12-18 14:13:58,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4383 to 2070. [2019-12-18 14:13:58,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2070 states. [2019-12-18 14:13:58,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 4705 transitions. [2019-12-18 14:13:58,573 INFO L78 Accepts]: Start accepts. Automaton has 2070 states and 4705 transitions. Word has length 26 [2019-12-18 14:13:58,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:13:58,574 INFO L462 AbstractCegarLoop]: Abstraction has 2070 states and 4705 transitions. [2019-12-18 14:13:58,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:13:58,574 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 4705 transitions. [2019-12-18 14:13:58,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 14:13:58,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:13:58,577 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 14:13:58,577 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:13:58,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:13:58,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1827812304, now seen corresponding path program 1 times [2019-12-18 14:13:58,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:13:58,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202808425] [2019-12-18 14:13:58,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:13:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:13:58,657 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 14:13:58,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202808425] [2019-12-18 14:13:58,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:13:58,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:13:58,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801622454] [2019-12-18 14:13:58,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:13:58,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:13:58,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:13:58,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:13:58,660 INFO L87 Difference]: Start difference. First operand 2070 states and 4705 transitions. Second operand 5 states. [2019-12-18 14:13:59,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:13:59,211 INFO L93 Difference]: Finished difference Result 3102 states and 6886 transitions. [2019-12-18 14:13:59,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:13:59,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 14:13:59,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:13:59,217 INFO L225 Difference]: With dead ends: 3102 [2019-12-18 14:13:59,217 INFO L226 Difference]: Without dead ends: 3102 [2019-12-18 14:13:59,218 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 14:13:59,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3102 states. [2019-12-18 14:13:59,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3102 to 2654. [2019-12-18 14:13:59,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2654 states. [2019-12-18 14:13:59,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2654 states and 5970 transitions. [2019-12-18 14:13:59,266 INFO L78 Accepts]: Start accepts. Automaton has 2654 states and 5970 transitions. Word has length 27 [2019-12-18 14:13:59,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:13:59,266 INFO L462 AbstractCegarLoop]: Abstraction has 2654 states and 5970 transitions. [2019-12-18 14:13:59,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:13:59,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2654 states and 5970 transitions. [2019-12-18 14:13:59,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 14:13:59,271 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:13:59,271 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 14:13:59,271 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:13:59,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:13:59,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1234551102, now seen corresponding path program 1 times [2019-12-18 14:13:59,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:13:59,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665053488] [2019-12-18 14:13:59,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:13:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:13:59,341 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 14:13:59,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665053488] [2019-12-18 14:13:59,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:13:59,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:13:59,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104236126] [2019-12-18 14:13:59,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:13:59,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:13:59,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:13:59,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:13:59,343 INFO L87 Difference]: Start difference. First operand 2654 states and 5970 transitions. Second operand 5 states. [2019-12-18 14:13:59,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:13:59,393 INFO L93 Difference]: Finished difference Result 1623 states and 3504 transitions. [2019-12-18 14:13:59,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:13:59,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 14:13:59,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:13:59,397 INFO L225 Difference]: With dead ends: 1623 [2019-12-18 14:13:59,397 INFO L226 Difference]: Without dead ends: 1475 [2019-12-18 14:13:59,397 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 14:13:59,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2019-12-18 14:13:59,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1374. [2019-12-18 14:13:59,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1374 states. [2019-12-18 14:13:59,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2999 transitions. [2019-12-18 14:13:59,426 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2999 transitions. Word has length 28 [2019-12-18 14:13:59,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:13:59,426 INFO L462 AbstractCegarLoop]: Abstraction has 1374 states and 2999 transitions. [2019-12-18 14:13:59,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:13:59,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2999 transitions. [2019-12-18 14:13:59,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 14:13:59,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:13:59,432 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 14:13:59,432 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:13:59,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:13:59,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1528690992, now seen corresponding path program 1 times [2019-12-18 14:13:59,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:13:59,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315079081] [2019-12-18 14:13:59,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:13:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:13:59,553 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 14:13:59,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315079081] [2019-12-18 14:13:59,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:13:59,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:13:59,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845082139] [2019-12-18 14:13:59,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:13:59,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:13:59,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:13:59,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:13:59,557 INFO L87 Difference]: Start difference. First operand 1374 states and 2999 transitions. Second operand 7 states. [2019-12-18 14:13:59,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:13:59,828 INFO L93 Difference]: Finished difference Result 4064 states and 8639 transitions. [2019-12-18 14:13:59,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 14:13:59,828 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 14:13:59,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:13:59,832 INFO L225 Difference]: With dead ends: 4064 [2019-12-18 14:13:59,832 INFO L226 Difference]: Without dead ends: 2676 [2019-12-18 14:13:59,832 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 14:13:59,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2019-12-18 14:13:59,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 1440. [2019-12-18 14:13:59,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1440 states. [2019-12-18 14:13:59,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 3133 transitions. [2019-12-18 14:13:59,863 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 3133 transitions. Word has length 51 [2019-12-18 14:13:59,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:13:59,863 INFO L462 AbstractCegarLoop]: Abstraction has 1440 states and 3133 transitions. [2019-12-18 14:13:59,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:13:59,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 3133 transitions. [2019-12-18 14:13:59,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 14:13:59,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:13:59,868 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 14:13:59,868 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:13:59,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:13:59,868 INFO L82 PathProgramCache]: Analyzing trace with hash 517037056, now seen corresponding path program 2 times [2019-12-18 14:13:59,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:13:59,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170463324] [2019-12-18 14:13:59,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:13:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:14:00,022 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 14:14:00,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170463324] [2019-12-18 14:14:00,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:14:00,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:14:00,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049957028] [2019-12-18 14:14:00,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:14:00,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:14:00,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:14:00,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:14:00,025 INFO L87 Difference]: Start difference. First operand 1440 states and 3133 transitions. Second operand 7 states. [2019-12-18 14:14:01,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:14:01,339 INFO L93 Difference]: Finished difference Result 3010 states and 6346 transitions. [2019-12-18 14:14:01,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 14:14:01,339 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 14:14:01,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:14:01,343 INFO L225 Difference]: With dead ends: 3010 [2019-12-18 14:14:01,343 INFO L226 Difference]: Without dead ends: 3010 [2019-12-18 14:14:01,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-12-18 14:14:01,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3010 states. [2019-12-18 14:14:01,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 1524. [2019-12-18 14:14:01,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1524 states. [2019-12-18 14:14:01,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 3330 transitions. [2019-12-18 14:14:01,375 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 3330 transitions. Word has length 51 [2019-12-18 14:14:01,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:14:01,375 INFO L462 AbstractCegarLoop]: Abstraction has 1524 states and 3330 transitions. [2019-12-18 14:14:01,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:14:01,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 3330 transitions. [2019-12-18 14:14:01,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 14:14:01,380 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:14:01,380 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 14:14:01,380 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:14:01,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:14:01,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1191050856, now seen corresponding path program 3 times [2019-12-18 14:14:01,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:14:01,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742767406] [2019-12-18 14:14:01,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:14:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:14:01,548 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 14:14:01,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742767406] [2019-12-18 14:14:01,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:14:01,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:14:01,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654443161] [2019-12-18 14:14:01,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:14:01,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:14:01,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:14:01,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:14:01,550 INFO L87 Difference]: Start difference. First operand 1524 states and 3330 transitions. Second operand 3 states. [2019-12-18 14:14:01,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:14:01,608 INFO L93 Difference]: Finished difference Result 1933 states and 4174 transitions. [2019-12-18 14:14:01,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:14:01,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 14:14:01,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:14:01,611 INFO L225 Difference]: With dead ends: 1933 [2019-12-18 14:14:01,611 INFO L226 Difference]: Without dead ends: 1933 [2019-12-18 14:14:01,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:14:01,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2019-12-18 14:14:01,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1530. [2019-12-18 14:14:01,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1530 states. [2019-12-18 14:14:01,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 3346 transitions. [2019-12-18 14:14:01,637 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 3346 transitions. Word has length 51 [2019-12-18 14:14:01,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:14:01,638 INFO L462 AbstractCegarLoop]: Abstraction has 1530 states and 3346 transitions. [2019-12-18 14:14:01,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:14:01,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 3346 transitions. [2019-12-18 14:14:01,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 14:14:01,641 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:14:01,642 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 14:14:01,642 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:14:01,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:14:01,642 INFO L82 PathProgramCache]: Analyzing trace with hash -975275625, now seen corresponding path program 1 times [2019-12-18 14:14:01,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:14:01,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862142490] [2019-12-18 14:14:01,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:14:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:14:01,798 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 14:14:01,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862142490] [2019-12-18 14:14:01,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:14:01,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:14:01,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129261545] [2019-12-18 14:14:01,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 14:14:01,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:14:01,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 14:14:01,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:14:01,801 INFO L87 Difference]: Start difference. First operand 1530 states and 3346 transitions. Second operand 8 states. [2019-12-18 14:14:03,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:14:03,323 INFO L93 Difference]: Finished difference Result 3083 states and 6499 transitions. [2019-12-18 14:14:03,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 14:14:03,324 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-18 14:14:03,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:14:03,328 INFO L225 Difference]: With dead ends: 3083 [2019-12-18 14:14:03,329 INFO L226 Difference]: Without dead ends: 3083 [2019-12-18 14:14:03,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2019-12-18 14:14:03,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2019-12-18 14:14:03,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 1557. [2019-12-18 14:14:03,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1557 states. [2019-12-18 14:14:03,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 3381 transitions. [2019-12-18 14:14:03,363 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 3381 transitions. Word has length 52 [2019-12-18 14:14:03,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:14:03,363 INFO L462 AbstractCegarLoop]: Abstraction has 1557 states and 3381 transitions. [2019-12-18 14:14:03,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 14:14:03,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 3381 transitions. [2019-12-18 14:14:03,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 14:14:03,366 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:14:03,367 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 14:14:03,367 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:14:03,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:14:03,367 INFO L82 PathProgramCache]: Analyzing trace with hash -709931818, now seen corresponding path program 1 times [2019-12-18 14:14:03,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:14:03,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341564297] [2019-12-18 14:14:03,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:14:03,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:14:03,483 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 14:14:03,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341564297] [2019-12-18 14:14:03,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:14:03,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:14:03,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191911177] [2019-12-18 14:14:03,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:14:03,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:14:03,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:14:03,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:14:03,485 INFO L87 Difference]: Start difference. First operand 1557 states and 3381 transitions. Second operand 7 states. [2019-12-18 14:14:04,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:14:04,586 INFO L93 Difference]: Finished difference Result 2962 states and 6177 transitions. [2019-12-18 14:14:04,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 14:14:04,586 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-18 14:14:04,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:14:04,590 INFO L225 Difference]: With dead ends: 2962 [2019-12-18 14:14:04,591 INFO L226 Difference]: Without dead ends: 2962 [2019-12-18 14:14:04,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-12-18 14:14:04,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2019-12-18 14:14:04,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 1592. [2019-12-18 14:14:04,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1592 states. [2019-12-18 14:14:04,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 3462 transitions. [2019-12-18 14:14:04,617 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 3462 transitions. Word has length 52 [2019-12-18 14:14:04,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:14:04,618 INFO L462 AbstractCegarLoop]: Abstraction has 1592 states and 3462 transitions. [2019-12-18 14:14:04,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:14:04,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 3462 transitions. [2019-12-18 14:14:04,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 14:14:04,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:14:04,621 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 14:14:04,622 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:14:04,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:14:04,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1725495463, now seen corresponding path program 2 times [2019-12-18 14:14:04,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:14:04,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537069127] [2019-12-18 14:14:04,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:14:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:14:04,702 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 14:14:04,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537069127] [2019-12-18 14:14:04,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:14:04,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:14:04,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338527411] [2019-12-18 14:14:04,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:14:04,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:14:04,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:14:04,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:14:04,705 INFO L87 Difference]: Start difference. First operand 1592 states and 3462 transitions. Second operand 3 states. [2019-12-18 14:14:04,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:14:04,720 INFO L93 Difference]: Finished difference Result 1591 states and 3460 transitions. [2019-12-18 14:14:04,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:14:04,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 14:14:04,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:14:04,723 INFO L225 Difference]: With dead ends: 1591 [2019-12-18 14:14:04,723 INFO L226 Difference]: Without dead ends: 1591 [2019-12-18 14:14:04,723 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 14:14:04,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2019-12-18 14:14:04,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1125. [2019-12-18 14:14:04,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2019-12-18 14:14:04,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 2488 transitions. [2019-12-18 14:14:04,749 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 2488 transitions. Word has length 52 [2019-12-18 14:14:04,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:14:04,750 INFO L462 AbstractCegarLoop]: Abstraction has 1125 states and 2488 transitions. [2019-12-18 14:14:04,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:14:04,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 2488 transitions. [2019-12-18 14:14:04,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 14:14:04,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:14:04,753 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 14:14:04,753 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:14:04,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:14:04,753 INFO L82 PathProgramCache]: Analyzing trace with hash 238171223, now seen corresponding path program 1 times [2019-12-18 14:14:04,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:14:04,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156006853] [2019-12-18 14:14:04,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:14:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:14:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:14:04,877 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:14:04,877 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:14:04,883 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_~weak$$choice2~0_120 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_40 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1705~0.base_24|) (= 0 |v_ULTIMATE.start_main_~#t1705~0.offset_18|) (= 0 v_~x$read_delayed_var~0.base_7) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t1705~0.base_24| 1)) (= 0 v_~__unbuffered_cnt~0_63) (= v_~main$tmp_guard1~0_41 0) (= 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 (select .cse0 |v_ULTIMATE.start_main_~#t1705~0.base_24|)) (= 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) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1705~0.base_24| 4) |v_#length_13|) (= 0 v_~x$w_buff0_used~0_792) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1705~0.base_24| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1705~0.base_24|) |v_ULTIMATE.start_main_~#t1705~0.offset_18| 0)) |v_#memory_int_13|) (= 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, ULTIMATE.start_main_~#t1706~0.base=|v_ULTIMATE.start_main_~#t1706~0.base_16|, #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|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, #length=|v_#length_13|, ~y~0=v_~y~0_147, ULTIMATE.start_main_~#t1705~0.offset=|v_ULTIMATE.start_main_~#t1705~0.offset_18|, ULTIMATE.start_main_~#t1705~0.base=|v_ULTIMATE.start_main_~#t1705~0.base_24|, ULTIMATE.start_main_~#t1706~0.offset=|v_ULTIMATE.start_main_~#t1706~0.offset_14|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_133, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~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, ~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, #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, ULTIMATE.start_main_~#t1706~0.base, #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, ~__unbuffered_p1_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t1705~0.offset, ULTIMATE.start_main_~#t1705~0.base, ULTIMATE.start_main_~#t1706~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~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, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, 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 14:14:04,884 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 14:14:04,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-1-->L799: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1706~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t1706~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t1706~0.base_12| 0)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1706~0.base_12| 1) |v_#valid_27|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1706~0.base_12|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1706~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1706~0.base_12|) |v_ULTIMATE.start_main_~#t1706~0.offset_10| 1)) |v_#memory_int_9|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1706~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1706~0.offset=|v_ULTIMATE.start_main_~#t1706~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1706~0.base=|v_ULTIMATE.start_main_~#t1706~0.base_12|, #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|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1706~0.offset, ULTIMATE.start_main_~#t1706~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 14:14:04,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In797037317 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In797037317 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out797037317|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In797037317 |P0Thread1of1ForFork0_#t~ite5_Out797037317|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In797037317, ~x$w_buff0_used~0=~x$w_buff0_used~0_In797037317} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out797037317|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In797037317, ~x$w_buff0_used~0=~x$w_buff0_used~0_In797037317} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 14:14:04,890 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-787899414 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out-787899414| ~x$w_buff0~0_In-787899414) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In-787899414| |P1Thread1of1ForFork1_#t~ite14_Out-787899414|)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-787899414 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-787899414 256)) .cse1) (and (= 0 (mod ~x$r_buff1_thd2~0_In-787899414 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-787899414 256)))) (= |P1Thread1of1ForFork1_#t~ite15_Out-787899414| |P1Thread1of1ForFork1_#t~ite14_Out-787899414|) (= ~x$w_buff0~0_In-787899414 |P1Thread1of1ForFork1_#t~ite14_Out-787899414|) .cse0))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-787899414, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-787899414, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-787899414, ~weak$$choice2~0=~weak$$choice2~0_In-787899414, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-787899414, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-787899414|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-787899414} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-787899414, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-787899414, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-787899414, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-787899414|, ~weak$$choice2~0=~weak$$choice2~0_In-787899414, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-787899414, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-787899414|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-787899414} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 14:14:04,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1568172535 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-1568172535 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1568172535 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd1~0_In-1568172535 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-1568172535| ~x$w_buff1_used~0_In-1568172535) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1568172535| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1568172535, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1568172535, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1568172535, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1568172535} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1568172535|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1568172535, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1568172535, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1568172535, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1568172535} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 14:14:04,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1441202035 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1441202035 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd1~0_Out-1441202035)) (and (= ~x$r_buff0_thd1~0_In-1441202035 ~x$r_buff0_thd1~0_Out-1441202035) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1441202035, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1441202035} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-1441202035, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1441202035|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1441202035} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 14:14:04,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-746380217 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-746380217 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-746380217 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-746380217 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-746380217| ~x$r_buff1_thd1~0_In-746380217)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-746380217|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-746380217, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-746380217, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-746380217, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-746380217} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-746380217, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-746380217|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-746380217, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-746380217, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-746380217} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 14:14:04,893 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 14:14:04,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-->L764-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In2048320048 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite18_Out2048320048| |P1Thread1of1ForFork1_#t~ite17_Out2048320048|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In2048320048 256)))) (or (and (= (mod ~x$w_buff1_used~0_In2048320048 256) 0) .cse0) (= (mod ~x$w_buff0_used~0_In2048320048 256) 0) (and .cse0 (= 0 (mod ~x$r_buff1_thd2~0_In2048320048 256))))) (= ~x$w_buff1~0_In2048320048 |P1Thread1of1ForFork1_#t~ite17_Out2048320048|) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite17_In2048320048| |P1Thread1of1ForFork1_#t~ite17_Out2048320048|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite18_Out2048320048| ~x$w_buff1~0_In2048320048)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In2048320048, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2048320048, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2048320048, ~weak$$choice2~0=~weak$$choice2~0_In2048320048, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2048320048, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In2048320048|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2048320048} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out2048320048|, ~x$w_buff1~0=~x$w_buff1~0_In2048320048, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2048320048, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2048320048, ~weak$$choice2~0=~weak$$choice2~0_In2048320048, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2048320048, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out2048320048|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2048320048} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-18 14:14:04,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-855734853 256) 0))) (or (and (= ~x$w_buff0_used~0_In-855734853 |P1Thread1of1ForFork1_#t~ite21_Out-855734853|) (= |P1Thread1of1ForFork1_#t~ite20_In-855734853| |P1Thread1of1ForFork1_#t~ite20_Out-855734853|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out-855734853| |P1Thread1of1ForFork1_#t~ite21_Out-855734853|) (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-855734853 256) 0))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-855734853 256))) (and (= 0 (mod ~x$r_buff1_thd2~0_In-855734853 256)) .cse1) (= (mod ~x$w_buff0_used~0_In-855734853 256) 0))) .cse0 (= |P1Thread1of1ForFork1_#t~ite20_Out-855734853| ~x$w_buff0_used~0_In-855734853)))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-855734853|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-855734853, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-855734853, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-855734853, ~weak$$choice2~0=~weak$$choice2~0_In-855734853, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-855734853} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-855734853|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-855734853, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-855734853, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-855734853|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-855734853, ~weak$$choice2~0=~weak$$choice2~0_In-855734853, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-855734853} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 14:14:04,896 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 14:14:04,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2027612129 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_In2027612129| |P1Thread1of1ForFork1_#t~ite29_Out2027612129|) (= |P1Thread1of1ForFork1_#t~ite30_Out2027612129| ~x$r_buff1_thd2~0_In2027612129) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out2027612129| ~x$r_buff1_thd2~0_In2027612129) (= |P1Thread1of1ForFork1_#t~ite30_Out2027612129| |P1Thread1of1ForFork1_#t~ite29_Out2027612129|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In2027612129 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In2027612129 256)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In2027612129 256))) (and (= 0 (mod ~x$r_buff1_thd2~0_In2027612129 256)) .cse1)))))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In2027612129|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2027612129, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2027612129, ~weak$$choice2~0=~weak$$choice2~0_In2027612129, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2027612129, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2027612129} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out2027612129|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out2027612129|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2027612129, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2027612129, ~weak$$choice2~0=~weak$$choice2~0_In2027612129, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2027612129, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2027612129} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 14:14:04,898 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 14:14:04,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1289145098 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1289145098 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out1289145098| ~x$w_buff1~0_In1289145098)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out1289145098| ~x~0_In1289145098) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1289145098, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1289145098, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1289145098, ~x~0=~x~0_In1289145098} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1289145098, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1289145098, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1289145098, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1289145098|, ~x~0=~x~0_In1289145098} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 14:14:04,899 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 14:14:04,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In269004390 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In269004390 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out269004390| 0)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out269004390| ~x$w_buff0_used~0_In269004390) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In269004390, ~x$w_buff0_used~0=~x$w_buff0_used~0_In269004390} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out269004390|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In269004390, ~x$w_buff0_used~0=~x$w_buff0_used~0_In269004390} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 14:14:04,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In1190000522 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1190000522 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1190000522 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In1190000522 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out1190000522| 0)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out1190000522| ~x$w_buff1_used~0_In1190000522) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1190000522, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1190000522, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1190000522, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1190000522} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1190000522, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1190000522, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1190000522|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1190000522, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1190000522} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 14:14:04,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In222854817 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In222854817 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out222854817| 0)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_In222854817 |P1Thread1of1ForFork1_#t~ite36_Out222854817|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In222854817, ~x$w_buff0_used~0=~x$w_buff0_used~0_In222854817} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In222854817, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out222854817|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In222854817} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 14:14:04,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd2~0_In220547292 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In220547292 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In220547292 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In220547292 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out220547292|)) (and (or .cse1 .cse0) (= ~x$r_buff1_thd2~0_In220547292 |P1Thread1of1ForFork1_#t~ite37_Out220547292|) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In220547292, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In220547292, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In220547292, ~x$w_buff0_used~0=~x$w_buff0_used~0_In220547292} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In220547292, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In220547292, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In220547292, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out220547292|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In220547292} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 14:14:04,902 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 14:14:04,903 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 14:14:04,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In897764431 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In897764431 256)))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In897764431 |ULTIMATE.start_main_#t~ite40_Out897764431|)) (and (= ~x~0_In897764431 |ULTIMATE.start_main_#t~ite40_Out897764431|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In897764431, ~x$w_buff1_used~0=~x$w_buff1_used~0_In897764431, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In897764431, ~x~0=~x~0_In897764431} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out897764431|, ~x$w_buff1~0=~x$w_buff1~0_In897764431, ~x$w_buff1_used~0=~x$w_buff1_used~0_In897764431, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In897764431, ~x~0=~x~0_In897764431} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 14:14:04,903 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 14:14:04,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In501518862 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In501518862 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out501518862| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In501518862 |ULTIMATE.start_main_#t~ite42_Out501518862|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In501518862, ~x$w_buff0_used~0=~x$w_buff0_used~0_In501518862} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In501518862, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out501518862|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In501518862} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 14:14:04,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In1719828815 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd0~0_In1719828815 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In1719828815 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In1719828815 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out1719828815| ~x$w_buff1_used~0_In1719828815)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out1719828815|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1719828815, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1719828815, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1719828815, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1719828815} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1719828815, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1719828815, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1719828815|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1719828815, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1719828815} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 14:14:04,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1343673774 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1343673774 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1343673774|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd0~0_In-1343673774 |ULTIMATE.start_main_#t~ite44_Out-1343673774|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1343673774, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1343673774} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1343673774, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1343673774|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1343673774} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 14:14:04,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-1577196307 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1577196307 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1577196307 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1577196307 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In-1577196307 |ULTIMATE.start_main_#t~ite45_Out-1577196307|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1577196307|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1577196307, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1577196307, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1577196307, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1577196307} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1577196307, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1577196307, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1577196307, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1577196307|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1577196307} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 14:14:04,906 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 14:14:05,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:14:05 BasicIcfg [2019-12-18 14:14:05,015 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:14:05,018 INFO L168 Benchmark]: Toolchain (without parser) took 20598.87 ms. Allocated memory was 145.8 MB in the beginning and 748.7 MB in the end (delta: 602.9 MB). Free memory was 101.3 MB in the beginning and 435.8 MB in the end (delta: -334.4 MB). Peak memory consumption was 268.5 MB. Max. memory is 7.1 GB. [2019-12-18 14:14:05,019 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.8 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 14:14:05,020 INFO L168 Benchmark]: CACSL2BoogieTranslator took 910.17 ms. Allocated memory was 145.8 MB in the beginning and 204.5 MB in the end (delta: 58.7 MB). Free memory was 101.1 MB in the beginning and 158.1 MB in the end (delta: -57.0 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-18 14:14:05,020 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.67 ms. Allocated memory is still 204.5 MB. Free memory was 158.1 MB in the beginning and 155.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:14:05,021 INFO L168 Benchmark]: Boogie Preprocessor took 37.60 ms. Allocated memory is still 204.5 MB. Free memory was 155.5 MB in the beginning and 152.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:14:05,022 INFO L168 Benchmark]: RCFGBuilder took 755.28 ms. Allocated memory is still 204.5 MB. Free memory was 152.8 MB in the beginning and 109.0 MB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:14:05,023 INFO L168 Benchmark]: TraceAbstraction took 18820.13 ms. Allocated memory was 204.5 MB in the beginning and 748.7 MB in the end (delta: 544.2 MB). Free memory was 108.4 MB in the beginning and 435.8 MB in the end (delta: -327.4 MB). Peak memory consumption was 216.8 MB. Max. memory is 7.1 GB. [2019-12-18 14:14:05,027 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.22 ms. Allocated memory is still 145.8 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 910.17 ms. Allocated memory was 145.8 MB in the beginning and 204.5 MB in the end (delta: 58.7 MB). Free memory was 101.1 MB in the beginning and 158.1 MB in the end (delta: -57.0 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.67 ms. Allocated memory is still 204.5 MB. Free memory was 158.1 MB in the beginning and 155.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.60 ms. Allocated memory is still 204.5 MB. Free memory was 155.5 MB in the beginning and 152.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 755.28 ms. Allocated memory is still 204.5 MB. Free memory was 152.8 MB in the beginning and 109.0 MB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18820.13 ms. Allocated memory was 204.5 MB in the beginning and 748.7 MB in the end (delta: 544.2 MB). Free memory was 108.4 MB in the beginning and 435.8 MB in the end (delta: -327.4 MB). Peak memory consumption was 216.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 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.9s, 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(&t1705, ((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(&t1706, ((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: 18.5s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2433 SDtfs, 2846 SDslu, 5286 SDs, 0 SdLazy, 4129 SolverSat, 215 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 33 SyntacticMatches, 12 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.4s 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.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 14455 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 529 NumberOfCodeBlocks, 529 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 461 ConstructedInterpolants, 0 QuantifiedInterpolants, 62555 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...