/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/rfi008_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:15:39,064 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:15:39,067 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:15:39,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:15:39,085 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:15:39,086 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:15:39,087 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:15:39,089 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:15:39,091 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:15:39,092 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:15:39,093 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:15:39,094 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:15:39,094 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:15:39,095 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:15:39,096 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:15:39,097 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:15:39,097 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:15:39,098 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:15:39,100 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:15:39,102 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:15:39,103 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:15:39,105 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:15:39,106 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:15:39,106 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:15:39,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:15:39,109 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:15:39,109 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:15:39,110 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:15:39,110 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:15:39,111 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:15:39,112 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:15:39,112 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:15:39,113 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:15:39,114 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:15:39,115 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:15:39,115 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:15:39,116 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:15:39,116 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:15:39,116 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:15:39,117 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:15:39,117 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:15:39,118 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:15:39,132 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:15:39,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:15:39,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:15:39,134 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:15:39,134 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:15:39,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:15:39,135 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:15:39,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:15:39,135 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:15:39,135 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:15:39,135 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:15:39,135 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:15:39,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:15:39,136 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:15:39,136 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:15:39,136 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:15:39,136 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:15:39,137 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:15:39,137 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:15:39,137 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:15:39,137 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:15:39,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:15:39,138 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:15:39,138 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:15:39,138 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:15:39,138 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:15:39,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:15:39,139 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:15:39,139 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:15:39,139 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:15:39,405 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:15:39,426 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:15:39,430 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:15:39,431 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:15:39,432 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:15:39,433 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi008_rmo.opt.i [2019-12-18 14:15:39,508 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3750ab86c/032fc85d802f4335bad248829a85c00d/FLAGd7e132bcf [2019-12-18 14:15:40,084 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:15:40,085 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008_rmo.opt.i [2019-12-18 14:15:40,100 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3750ab86c/032fc85d802f4335bad248829a85c00d/FLAGd7e132bcf [2019-12-18 14:15:40,336 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3750ab86c/032fc85d802f4335bad248829a85c00d [2019-12-18 14:15:40,344 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:15:40,345 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:15:40,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:15:40,346 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:15:40,350 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:15:40,351 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:15:40" (1/1) ... [2019-12-18 14:15:40,353 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@357bbf01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:15:40, skipping insertion in model container [2019-12-18 14:15:40,354 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:15:40" (1/1) ... [2019-12-18 14:15:40,359 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:15:40,422 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:15:40,899 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:15:40,911 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:15:41,007 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:15:41,089 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:15:41,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:15:41 WrapperNode [2019-12-18 14:15:41,090 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:15:41,091 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:15:41,091 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:15:41,091 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:15:41,100 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:15:41" (1/1) ... [2019-12-18 14:15:41,121 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:15:41" (1/1) ... [2019-12-18 14:15:41,158 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:15:41,158 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:15:41,159 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:15:41,159 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:15:41,169 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:15:41" (1/1) ... [2019-12-18 14:15:41,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:15:41" (1/1) ... [2019-12-18 14:15:41,174 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:15:41" (1/1) ... [2019-12-18 14:15:41,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:15:41" (1/1) ... [2019-12-18 14:15:41,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:15:41" (1/1) ... [2019-12-18 14:15:41,191 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:15:41" (1/1) ... [2019-12-18 14:15:41,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:15:41" (1/1) ... [2019-12-18 14:15:41,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:15:41,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:15:41,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:15:41,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:15:41,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:15:41" (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:15:41,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:15:41,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:15:41,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:15:41,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:15:41,299 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:15:41,299 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:15:41,299 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:15:41,300 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:15:41,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:15:41,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:15:41,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:15:41,304 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:15:42,224 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:15:42,224 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:15:42,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:15:42 BoogieIcfgContainer [2019-12-18 14:15:42,225 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:15:42,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:15:42,227 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:15:42,230 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:15:42,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:15:40" (1/3) ... [2019-12-18 14:15:42,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31c30642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:15:42, skipping insertion in model container [2019-12-18 14:15:42,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:15:41" (2/3) ... [2019-12-18 14:15:42,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31c30642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:15:42, skipping insertion in model container [2019-12-18 14:15:42,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:15:42" (3/3) ... [2019-12-18 14:15:42,234 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi008_rmo.opt.i [2019-12-18 14:15:42,244 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:15:42,244 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:15:42,251 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:15:42,251 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:15:42,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,299 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,300 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,343 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,344 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,344 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,344 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,344 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,372 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,373 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,381 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,382 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,384 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:15:42,401 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 14:15:42,422 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:15:42,422 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:15:42,422 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:15:42,422 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:15:42,422 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:15:42,423 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:15:42,423 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:15:42,423 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:15:42,441 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 228 transitions [2019-12-18 14:15:42,443 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-18 14:15:42,540 INFO L126 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-18 14:15:42,541 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:15:42,563 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 551 event pairs. 6/174 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-18 14:15:42,593 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-18 14:15:42,654 INFO L126 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-18 14:15:42,654 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:15:42,664 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 551 event pairs. 6/174 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-18 14:15:42,691 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-18 14:15:42,692 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:15:47,772 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 14:15:47,883 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 14:15:47,945 INFO L206 etLargeBlockEncoding]: Checked pairs total: 125257 [2019-12-18 14:15:47,945 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-18 14:15:47,949 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 105 places, 129 transitions [2019-12-18 14:15:49,515 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25272 states. [2019-12-18 14:15:49,517 INFO L276 IsEmpty]: Start isEmpty. Operand 25272 states. [2019-12-18 14:15:49,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 14:15:49,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:15:49,524 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 14:15:49,524 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:15:49,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:15:49,529 INFO L82 PathProgramCache]: Analyzing trace with hash 961433507, now seen corresponding path program 1 times [2019-12-18 14:15:49,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:15:49,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743996373] [2019-12-18 14:15:49,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:15:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:15:49,764 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:15:49,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743996373] [2019-12-18 14:15:49,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:15:49,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:15:49,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179215023] [2019-12-18 14:15:49,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:15:49,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:15:49,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:15:49,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:15:49,790 INFO L87 Difference]: Start difference. First operand 25272 states. Second operand 3 states. [2019-12-18 14:15:50,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:15:50,207 INFO L93 Difference]: Finished difference Result 25080 states and 89817 transitions. [2019-12-18 14:15:50,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:15:50,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 14:15:50,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:15:50,433 INFO L225 Difference]: With dead ends: 25080 [2019-12-18 14:15:50,433 INFO L226 Difference]: Without dead ends: 23470 [2019-12-18 14:15:50,435 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:15:51,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23470 states. [2019-12-18 14:15:52,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23470 to 23470. [2019-12-18 14:15:52,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23470 states. [2019-12-18 14:15:52,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23470 states to 23470 states and 83991 transitions. [2019-12-18 14:15:52,614 INFO L78 Accepts]: Start accepts. Automaton has 23470 states and 83991 transitions. Word has length 5 [2019-12-18 14:15:52,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:15:52,615 INFO L462 AbstractCegarLoop]: Abstraction has 23470 states and 83991 transitions. [2019-12-18 14:15:52,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:15:52,615 INFO L276 IsEmpty]: Start isEmpty. Operand 23470 states and 83991 transitions. [2019-12-18 14:15:52,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:15:52,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:15:52,628 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:15:52,629 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:15:52,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:15:52,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1303916439, now seen corresponding path program 1 times [2019-12-18 14:15:52,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:15:52,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046310352] [2019-12-18 14:15:52,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:15:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:15:52,734 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:15:52,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046310352] [2019-12-18 14:15:52,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:15:52,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:15:52,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289864806] [2019-12-18 14:15:52,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:15:52,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:15:52,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:15:52,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:15:52,738 INFO L87 Difference]: Start difference. First operand 23470 states and 83991 transitions. Second operand 4 states. [2019-12-18 14:15:53,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:15:53,355 INFO L93 Difference]: Finished difference Result 36446 states and 124910 transitions. [2019-12-18 14:15:53,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:15:53,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:15:53,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:15:53,505 INFO L225 Difference]: With dead ends: 36446 [2019-12-18 14:15:53,506 INFO L226 Difference]: Without dead ends: 36430 [2019-12-18 14:15:53,507 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:15:55,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36430 states. [2019-12-18 14:15:56,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36430 to 35607. [2019-12-18 14:15:56,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35607 states. [2019-12-18 14:15:56,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35607 states to 35607 states and 122732 transitions. [2019-12-18 14:15:56,126 INFO L78 Accepts]: Start accepts. Automaton has 35607 states and 122732 transitions. Word has length 11 [2019-12-18 14:15:56,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:15:56,126 INFO L462 AbstractCegarLoop]: Abstraction has 35607 states and 122732 transitions. [2019-12-18 14:15:56,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:15:56,126 INFO L276 IsEmpty]: Start isEmpty. Operand 35607 states and 122732 transitions. [2019-12-18 14:15:56,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:15:56,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:15:56,129 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:15:56,129 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:15:56,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:15:56,129 INFO L82 PathProgramCache]: Analyzing trace with hash -273660052, now seen corresponding path program 1 times [2019-12-18 14:15:56,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:15:56,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675016918] [2019-12-18 14:15:56,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:15:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:15:56,194 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:15:56,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675016918] [2019-12-18 14:15:56,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:15:56,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:15:56,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173824813] [2019-12-18 14:15:56,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:15:56,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:15:56,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:15:56,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:15:56,197 INFO L87 Difference]: Start difference. First operand 35607 states and 122732 transitions. Second operand 4 states. [2019-12-18 14:15:56,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:15:56,630 INFO L93 Difference]: Finished difference Result 46394 states and 157073 transitions. [2019-12-18 14:15:56,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:15:56,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 14:15:56,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:15:56,779 INFO L225 Difference]: With dead ends: 46394 [2019-12-18 14:15:56,779 INFO L226 Difference]: Without dead ends: 46379 [2019-12-18 14:15:56,780 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:15:57,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46379 states. [2019-12-18 14:15:58,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46379 to 41501. [2019-12-18 14:15:58,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41501 states. [2019-12-18 14:16:00,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41501 states to 41501 states and 142005 transitions. [2019-12-18 14:16:00,857 INFO L78 Accepts]: Start accepts. Automaton has 41501 states and 142005 transitions. Word has length 14 [2019-12-18 14:16:00,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:16:00,860 INFO L462 AbstractCegarLoop]: Abstraction has 41501 states and 142005 transitions. [2019-12-18 14:16:00,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:16:00,860 INFO L276 IsEmpty]: Start isEmpty. Operand 41501 states and 142005 transitions. [2019-12-18 14:16:00,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 14:16:00,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:16:00,865 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:16:00,865 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:16:00,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:16:00,865 INFO L82 PathProgramCache]: Analyzing trace with hash 106501689, now seen corresponding path program 1 times [2019-12-18 14:16:00,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:16:00,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478145477] [2019-12-18 14:16:00,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:16:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:16:00,950 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:16:00,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478145477] [2019-12-18 14:16:00,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:16:00,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:16:00,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442848332] [2019-12-18 14:16:00,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:16:00,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:16:00,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:16:00,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:16:00,953 INFO L87 Difference]: Start difference. First operand 41501 states and 142005 transitions. Second operand 3 states. [2019-12-18 14:16:01,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:16:01,308 INFO L93 Difference]: Finished difference Result 67890 states and 222025 transitions. [2019-12-18 14:16:01,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:16:01,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 14:16:01,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:16:01,495 INFO L225 Difference]: With dead ends: 67890 [2019-12-18 14:16:01,495 INFO L226 Difference]: Without dead ends: 67890 [2019-12-18 14:16:01,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:16:02,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67890 states. [2019-12-18 14:16:03,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67890 to 60518. [2019-12-18 14:16:03,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60518 states. [2019-12-18 14:16:03,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60518 states to 60518 states and 201033 transitions. [2019-12-18 14:16:03,617 INFO L78 Accepts]: Start accepts. Automaton has 60518 states and 201033 transitions. Word has length 15 [2019-12-18 14:16:03,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:16:03,617 INFO L462 AbstractCegarLoop]: Abstraction has 60518 states and 201033 transitions. [2019-12-18 14:16:03,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:16:03,617 INFO L276 IsEmpty]: Start isEmpty. Operand 60518 states and 201033 transitions. [2019-12-18 14:16:03,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 14:16:03,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:16:03,625 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:16:03,625 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:16:03,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:16:03,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1396090736, now seen corresponding path program 1 times [2019-12-18 14:16:03,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:16:03,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911236322] [2019-12-18 14:16:03,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:16:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:16:03,672 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:16:03,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911236322] [2019-12-18 14:16:03,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:16:03,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:16:03,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579046458] [2019-12-18 14:16:03,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:16:03,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:16:03,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:16:03,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:16:03,676 INFO L87 Difference]: Start difference. First operand 60518 states and 201033 transitions. Second operand 3 states. [2019-12-18 14:16:03,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:16:03,945 INFO L93 Difference]: Finished difference Result 57116 states and 189493 transitions. [2019-12-18 14:16:03,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:16:03,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 14:16:03,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:16:04,054 INFO L225 Difference]: With dead ends: 57116 [2019-12-18 14:16:04,055 INFO L226 Difference]: Without dead ends: 57116 [2019-12-18 14:16:04,055 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:16:04,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57116 states. [2019-12-18 14:16:05,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57116 to 57116. [2019-12-18 14:16:05,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57116 states. [2019-12-18 14:16:06,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57116 states to 57116 states and 189493 transitions. [2019-12-18 14:16:06,388 INFO L78 Accepts]: Start accepts. Automaton has 57116 states and 189493 transitions. Word has length 16 [2019-12-18 14:16:06,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:16:06,389 INFO L462 AbstractCegarLoop]: Abstraction has 57116 states and 189493 transitions. [2019-12-18 14:16:06,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:16:06,389 INFO L276 IsEmpty]: Start isEmpty. Operand 57116 states and 189493 transitions. [2019-12-18 14:16:06,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 14:16:06,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:16:06,395 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:16:06,395 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:16:06,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:16:06,405 INFO L82 PathProgramCache]: Analyzing trace with hash -717781961, now seen corresponding path program 1 times [2019-12-18 14:16:06,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:16:06,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462885077] [2019-12-18 14:16:06,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:16:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:16:06,494 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:16:06,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462885077] [2019-12-18 14:16:06,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:16:06,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:16:06,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510958669] [2019-12-18 14:16:06,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:16:06,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:16:06,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:16:06,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:16:06,497 INFO L87 Difference]: Start difference. First operand 57116 states and 189493 transitions. Second operand 4 states. [2019-12-18 14:16:07,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:16:07,065 INFO L93 Difference]: Finished difference Result 71016 states and 232026 transitions. [2019-12-18 14:16:07,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:16:07,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 14:16:07,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:16:07,207 INFO L225 Difference]: With dead ends: 71016 [2019-12-18 14:16:07,207 INFO L226 Difference]: Without dead ends: 70999 [2019-12-18 14:16:07,207 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:16:07,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70999 states. [2019-12-18 14:16:10,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70999 to 57888. [2019-12-18 14:16:10,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57888 states. [2019-12-18 14:16:10,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57888 states to 57888 states and 192018 transitions. [2019-12-18 14:16:10,754 INFO L78 Accepts]: Start accepts. Automaton has 57888 states and 192018 transitions. Word has length 17 [2019-12-18 14:16:10,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:16:10,754 INFO L462 AbstractCegarLoop]: Abstraction has 57888 states and 192018 transitions. [2019-12-18 14:16:10,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:16:10,754 INFO L276 IsEmpty]: Start isEmpty. Operand 57888 states and 192018 transitions. [2019-12-18 14:16:11,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 14:16:11,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:16:11,078 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] [2019-12-18 14:16:11,079 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:16:11,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:16:11,079 INFO L82 PathProgramCache]: Analyzing trace with hash 211035802, now seen corresponding path program 1 times [2019-12-18 14:16:11,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:16:11,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30091791] [2019-12-18 14:16:11,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:16:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:16:11,148 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:16:11,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30091791] [2019-12-18 14:16:11,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:16:11,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:16:11,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078706453] [2019-12-18 14:16:11,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:16:11,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:16:11,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:16:11,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:16:11,151 INFO L87 Difference]: Start difference. First operand 57888 states and 192018 transitions. Second operand 5 states. [2019-12-18 14:16:12,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:16:12,012 INFO L93 Difference]: Finished difference Result 81597 states and 263870 transitions. [2019-12-18 14:16:12,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:16:12,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-18 14:16:12,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:16:12,169 INFO L225 Difference]: With dead ends: 81597 [2019-12-18 14:16:12,169 INFO L226 Difference]: Without dead ends: 81583 [2019-12-18 14:16:12,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:16:12,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81583 states. [2019-12-18 14:16:15,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81583 to 63420. [2019-12-18 14:16:15,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63420 states. [2019-12-18 14:16:15,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63420 states to 63420 states and 209260 transitions. [2019-12-18 14:16:15,695 INFO L78 Accepts]: Start accepts. Automaton has 63420 states and 209260 transitions. Word has length 20 [2019-12-18 14:16:15,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:16:15,695 INFO L462 AbstractCegarLoop]: Abstraction has 63420 states and 209260 transitions. [2019-12-18 14:16:15,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:16:15,696 INFO L276 IsEmpty]: Start isEmpty. Operand 63420 states and 209260 transitions. [2019-12-18 14:16:15,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 14:16:15,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:16:15,713 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] [2019-12-18 14:16:15,713 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:16:15,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:16:15,713 INFO L82 PathProgramCache]: Analyzing trace with hash 432950251, now seen corresponding path program 1 times [2019-12-18 14:16:15,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:16:15,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276220801] [2019-12-18 14:16:15,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:16:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:16:15,776 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:16:15,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276220801] [2019-12-18 14:16:15,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:16:15,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:16:15,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040144288] [2019-12-18 14:16:15,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:16:15,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:16:15,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:16:15,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:16:15,778 INFO L87 Difference]: Start difference. First operand 63420 states and 209260 transitions. Second operand 5 states. [2019-12-18 14:16:17,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:16:17,196 INFO L93 Difference]: Finished difference Result 85051 states and 274689 transitions. [2019-12-18 14:16:17,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:16:17,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-18 14:16:17,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:16:17,359 INFO L225 Difference]: With dead ends: 85051 [2019-12-18 14:16:17,359 INFO L226 Difference]: Without dead ends: 85023 [2019-12-18 14:16:17,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:16:17,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85023 states. [2019-12-18 14:16:21,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85023 to 59018. [2019-12-18 14:16:21,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59018 states. [2019-12-18 14:16:21,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59018 states to 59018 states and 195208 transitions. [2019-12-18 14:16:21,178 INFO L78 Accepts]: Start accepts. Automaton has 59018 states and 195208 transitions. Word has length 23 [2019-12-18 14:16:21,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:16:21,178 INFO L462 AbstractCegarLoop]: Abstraction has 59018 states and 195208 transitions. [2019-12-18 14:16:21,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:16:21,178 INFO L276 IsEmpty]: Start isEmpty. Operand 59018 states and 195208 transitions. [2019-12-18 14:16:21,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 14:16:21,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:16:21,227 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] [2019-12-18 14:16:21,227 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:16:21,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:16:21,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1492209156, now seen corresponding path program 1 times [2019-12-18 14:16:21,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:16:21,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53752936] [2019-12-18 14:16:21,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:16:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:16:21,280 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:16:21,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53752936] [2019-12-18 14:16:21,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:16:21,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:16:21,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337140704] [2019-12-18 14:16:21,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:16:21,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:16:21,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:16:21,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:16:21,283 INFO L87 Difference]: Start difference. First operand 59018 states and 195208 transitions. Second operand 3 states. [2019-12-18 14:16:21,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:16:21,503 INFO L93 Difference]: Finished difference Result 58992 states and 195131 transitions. [2019-12-18 14:16:21,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:16:21,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-18 14:16:21,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:16:21,613 INFO L225 Difference]: With dead ends: 58992 [2019-12-18 14:16:21,613 INFO L226 Difference]: Without dead ends: 58992 [2019-12-18 14:16:21,613 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:16:22,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58992 states. [2019-12-18 14:16:23,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58992 to 58992. [2019-12-18 14:16:23,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58992 states. [2019-12-18 14:16:23,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58992 states to 58992 states and 195131 transitions. [2019-12-18 14:16:23,289 INFO L78 Accepts]: Start accepts. Automaton has 58992 states and 195131 transitions. Word has length 30 [2019-12-18 14:16:23,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:16:23,290 INFO L462 AbstractCegarLoop]: Abstraction has 58992 states and 195131 transitions. [2019-12-18 14:16:23,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:16:23,290 INFO L276 IsEmpty]: Start isEmpty. Operand 58992 states and 195131 transitions. [2019-12-18 14:16:23,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 14:16:23,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:16:23,339 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] [2019-12-18 14:16:23,339 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:16:23,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:16:23,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1740768700, now seen corresponding path program 1 times [2019-12-18 14:16:23,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:16:23,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432623878] [2019-12-18 14:16:23,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:16:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:16:23,424 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:16:23,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432623878] [2019-12-18 14:16:23,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:16:23,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:16:23,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845778245] [2019-12-18 14:16:23,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:16:23,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:16:23,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:16:23,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:16:23,426 INFO L87 Difference]: Start difference. First operand 58992 states and 195131 transitions. Second operand 4 states. [2019-12-18 14:16:24,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:16:24,042 INFO L93 Difference]: Finished difference Result 110184 states and 357949 transitions. [2019-12-18 14:16:24,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:16:24,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-12-18 14:16:24,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:16:24,265 INFO L225 Difference]: With dead ends: 110184 [2019-12-18 14:16:24,265 INFO L226 Difference]: Without dead ends: 110184 [2019-12-18 14:16:24,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:16:25,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110184 states. [2019-12-18 14:16:26,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110184 to 75343. [2019-12-18 14:16:26,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75343 states. [2019-12-18 14:16:30,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75343 states to 75343 states and 250025 transitions. [2019-12-18 14:16:30,208 INFO L78 Accepts]: Start accepts. Automaton has 75343 states and 250025 transitions. Word has length 31 [2019-12-18 14:16:30,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:16:30,208 INFO L462 AbstractCegarLoop]: Abstraction has 75343 states and 250025 transitions. [2019-12-18 14:16:30,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:16:30,208 INFO L276 IsEmpty]: Start isEmpty. Operand 75343 states and 250025 transitions. [2019-12-18 14:16:30,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 14:16:30,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:16:30,269 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] [2019-12-18 14:16:30,269 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:16:30,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:16:30,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1176144700, now seen corresponding path program 2 times [2019-12-18 14:16:30,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:16:30,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152126428] [2019-12-18 14:16:30,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:16:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:16:30,337 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:16:30,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152126428] [2019-12-18 14:16:30,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:16:30,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:16:30,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057913064] [2019-12-18 14:16:30,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:16:30,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:16:30,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:16:30,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:16:30,339 INFO L87 Difference]: Start difference. First operand 75343 states and 250025 transitions. Second operand 3 states. [2019-12-18 14:16:30,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:16:30,629 INFO L93 Difference]: Finished difference Result 70492 states and 230603 transitions. [2019-12-18 14:16:30,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:16:30,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-18 14:16:30,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:16:30,760 INFO L225 Difference]: With dead ends: 70492 [2019-12-18 14:16:30,760 INFO L226 Difference]: Without dead ends: 70492 [2019-12-18 14:16:30,760 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:16:31,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70492 states. [2019-12-18 14:16:32,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70492 to 69294. [2019-12-18 14:16:32,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69294 states. [2019-12-18 14:16:32,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69294 states to 69294 states and 227027 transitions. [2019-12-18 14:16:32,684 INFO L78 Accepts]: Start accepts. Automaton has 69294 states and 227027 transitions. Word has length 31 [2019-12-18 14:16:32,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:16:32,684 INFO L462 AbstractCegarLoop]: Abstraction has 69294 states and 227027 transitions. [2019-12-18 14:16:32,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:16:32,684 INFO L276 IsEmpty]: Start isEmpty. Operand 69294 states and 227027 transitions. [2019-12-18 14:16:32,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 14:16:32,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:16:32,734 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] [2019-12-18 14:16:32,734 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:16:32,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:16:32,734 INFO L82 PathProgramCache]: Analyzing trace with hash -885277103, now seen corresponding path program 1 times [2019-12-18 14:16:32,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:16:32,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526993666] [2019-12-18 14:16:32,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:16:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:16:32,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:16:32,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526993666] [2019-12-18 14:16:32,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:16:32,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:16:32,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632591760] [2019-12-18 14:16:32,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:16:32,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:16:32,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:16:32,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:16:32,911 INFO L87 Difference]: Start difference. First operand 69294 states and 227027 transitions. Second operand 10 states. [2019-12-18 14:16:35,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:16:35,025 INFO L93 Difference]: Finished difference Result 166449 states and 542924 transitions. [2019-12-18 14:16:35,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 14:16:35,026 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-12-18 14:16:35,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:16:35,302 INFO L225 Difference]: With dead ends: 166449 [2019-12-18 14:16:35,302 INFO L226 Difference]: Without dead ends: 135356 [2019-12-18 14:16:35,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2019-12-18 14:16:36,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135356 states. [2019-12-18 14:16:38,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135356 to 108408. [2019-12-18 14:16:38,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108408 states. [2019-12-18 14:16:43,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108408 states to 108408 states and 356110 transitions. [2019-12-18 14:16:43,244 INFO L78 Accepts]: Start accepts. Automaton has 108408 states and 356110 transitions. Word has length 32 [2019-12-18 14:16:43,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:16:43,244 INFO L462 AbstractCegarLoop]: Abstraction has 108408 states and 356110 transitions. [2019-12-18 14:16:43,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:16:43,244 INFO L276 IsEmpty]: Start isEmpty. Operand 108408 states and 356110 transitions. [2019-12-18 14:16:43,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 14:16:43,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:16:43,337 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] [2019-12-18 14:16:43,338 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:16:43,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:16:43,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1566807549, now seen corresponding path program 2 times [2019-12-18 14:16:43,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:16:43,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508098607] [2019-12-18 14:16:43,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:16:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:16:43,528 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:16:43,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508098607] [2019-12-18 14:16:43,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:16:43,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:16:43,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142342581] [2019-12-18 14:16:43,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 14:16:43,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:16:43,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 14:16:43,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:16:43,531 INFO L87 Difference]: Start difference. First operand 108408 states and 356110 transitions. Second operand 12 states. [2019-12-18 14:16:46,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:16:46,489 INFO L93 Difference]: Finished difference Result 157610 states and 514012 transitions. [2019-12-18 14:16:46,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 14:16:46,490 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2019-12-18 14:16:46,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:16:46,792 INFO L225 Difference]: With dead ends: 157610 [2019-12-18 14:16:46,792 INFO L226 Difference]: Without dead ends: 147986 [2019-12-18 14:16:46,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=244, Invalid=812, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 14:16:47,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147986 states. [2019-12-18 14:16:49,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147986 to 108690. [2019-12-18 14:16:49,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108690 states. [2019-12-18 14:16:49,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108690 states to 108690 states and 356994 transitions. [2019-12-18 14:16:49,836 INFO L78 Accepts]: Start accepts. Automaton has 108690 states and 356994 transitions. Word has length 32 [2019-12-18 14:16:49,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:16:49,837 INFO L462 AbstractCegarLoop]: Abstraction has 108690 states and 356994 transitions. [2019-12-18 14:16:49,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 14:16:49,837 INFO L276 IsEmpty]: Start isEmpty. Operand 108690 states and 356994 transitions. [2019-12-18 14:16:49,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 14:16:49,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:16:49,929 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] [2019-12-18 14:16:49,930 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:16:49,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:16:49,930 INFO L82 PathProgramCache]: Analyzing trace with hash 2024101083, now seen corresponding path program 3 times [2019-12-18 14:16:49,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:16:49,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355407511] [2019-12-18 14:16:49,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:16:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:16:50,019 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:16:50,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355407511] [2019-12-18 14:16:50,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:16:50,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:16:50,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151963943] [2019-12-18 14:16:50,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:16:50,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:16:50,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:16:50,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:16:50,020 INFO L87 Difference]: Start difference. First operand 108690 states and 356994 transitions. Second operand 7 states. [2019-12-18 14:16:52,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:16:52,063 INFO L93 Difference]: Finished difference Result 190580 states and 622540 transitions. [2019-12-18 14:16:52,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 14:16:52,069 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-12-18 14:16:52,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:16:52,427 INFO L225 Difference]: With dead ends: 190580 [2019-12-18 14:16:52,427 INFO L226 Difference]: Without dead ends: 169507 [2019-12-18 14:16:52,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:16:53,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169507 states. [2019-12-18 14:16:55,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169507 to 110844. [2019-12-18 14:16:55,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110844 states. [2019-12-18 14:16:56,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110844 states to 110844 states and 363510 transitions. [2019-12-18 14:16:56,130 INFO L78 Accepts]: Start accepts. Automaton has 110844 states and 363510 transitions. Word has length 32 [2019-12-18 14:16:56,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:16:56,130 INFO L462 AbstractCegarLoop]: Abstraction has 110844 states and 363510 transitions. [2019-12-18 14:16:56,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:16:56,130 INFO L276 IsEmpty]: Start isEmpty. Operand 110844 states and 363510 transitions. [2019-12-18 14:16:56,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 14:16:56,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:16:56,233 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] [2019-12-18 14:16:56,233 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:16:56,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:16:56,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1444501905, now seen corresponding path program 4 times [2019-12-18 14:16:56,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:16:56,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363144059] [2019-12-18 14:16:56,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:16:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:16:56,317 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:16:56,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363144059] [2019-12-18 14:16:56,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:16:56,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:16:56,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774482400] [2019-12-18 14:16:56,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:16:56,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:16:56,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:16:56,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:16:56,319 INFO L87 Difference]: Start difference. First operand 110844 states and 363510 transitions. Second operand 7 states. [2019-12-18 14:16:58,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:16:58,901 INFO L93 Difference]: Finished difference Result 213159 states and 698970 transitions. [2019-12-18 14:16:58,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 14:16:58,901 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-12-18 14:16:58,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:16:59,313 INFO L225 Difference]: With dead ends: 213159 [2019-12-18 14:16:59,313 INFO L226 Difference]: Without dead ends: 199010 [2019-12-18 14:16:59,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:17:00,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199010 states. [2019-12-18 14:17:02,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199010 to 110823. [2019-12-18 14:17:02,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110823 states. [2019-12-18 14:17:03,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110823 states to 110823 states and 363487 transitions. [2019-12-18 14:17:03,208 INFO L78 Accepts]: Start accepts. Automaton has 110823 states and 363487 transitions. Word has length 32 [2019-12-18 14:17:03,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:17:03,208 INFO L462 AbstractCegarLoop]: Abstraction has 110823 states and 363487 transitions. [2019-12-18 14:17:03,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:17:03,209 INFO L276 IsEmpty]: Start isEmpty. Operand 110823 states and 363487 transitions. [2019-12-18 14:17:03,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 14:17:03,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:17:03,303 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] [2019-12-18 14:17:03,303 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:17:03,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:17:03,304 INFO L82 PathProgramCache]: Analyzing trace with hash -2141068655, now seen corresponding path program 5 times [2019-12-18 14:17:03,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:17:03,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250034790] [2019-12-18 14:17:03,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:17:03,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:17:03,412 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:17:03,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250034790] [2019-12-18 14:17:03,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:17:03,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:17:03,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138013062] [2019-12-18 14:17:03,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:17:03,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:17:03,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:17:03,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:17:03,414 INFO L87 Difference]: Start difference. First operand 110823 states and 363487 transitions. Second operand 9 states. [2019-12-18 14:17:05,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:17:05,659 INFO L93 Difference]: Finished difference Result 189382 states and 618306 transitions. [2019-12-18 14:17:05,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 14:17:05,660 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2019-12-18 14:17:05,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:17:06,021 INFO L225 Difference]: With dead ends: 189382 [2019-12-18 14:17:06,021 INFO L226 Difference]: Without dead ends: 178336 [2019-12-18 14:17:06,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2019-12-18 14:17:07,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178336 states. [2019-12-18 14:17:09,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178336 to 111346. [2019-12-18 14:17:09,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111346 states. [2019-12-18 14:17:09,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111346 states to 111346 states and 365110 transitions. [2019-12-18 14:17:09,708 INFO L78 Accepts]: Start accepts. Automaton has 111346 states and 365110 transitions. Word has length 32 [2019-12-18 14:17:09,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:17:09,708 INFO L462 AbstractCegarLoop]: Abstraction has 111346 states and 365110 transitions. [2019-12-18 14:17:09,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:17:09,709 INFO L276 IsEmpty]: Start isEmpty. Operand 111346 states and 365110 transitions. [2019-12-18 14:17:10,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 14:17:10,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:17:10,690 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] [2019-12-18 14:17:10,690 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:17:10,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:17:10,690 INFO L82 PathProgramCache]: Analyzing trace with hash 488930896, now seen corresponding path program 1 times [2019-12-18 14:17:10,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:17:10,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479990971] [2019-12-18 14:17:10,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:17:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:17:10,756 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:17:10,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479990971] [2019-12-18 14:17:10,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:17:10,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:17:10,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142603700] [2019-12-18 14:17:10,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:17:10,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:17:10,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:17:10,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:17:10,758 INFO L87 Difference]: Start difference. First operand 111346 states and 365110 transitions. Second operand 4 states. [2019-12-18 14:17:10,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:17:10,865 INFO L93 Difference]: Finished difference Result 16917 states and 46304 transitions. [2019-12-18 14:17:10,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:17:10,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-18 14:17:10,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:17:10,886 INFO L225 Difference]: With dead ends: 16917 [2019-12-18 14:17:10,886 INFO L226 Difference]: Without dead ends: 9787 [2019-12-18 14:17:10,887 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:17:10,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9787 states. [2019-12-18 14:17:11,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9787 to 9134. [2019-12-18 14:17:11,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9134 states. [2019-12-18 14:17:11,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9134 states to 9134 states and 21367 transitions. [2019-12-18 14:17:11,080 INFO L78 Accepts]: Start accepts. Automaton has 9134 states and 21367 transitions. Word has length 33 [2019-12-18 14:17:11,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:17:11,080 INFO L462 AbstractCegarLoop]: Abstraction has 9134 states and 21367 transitions. [2019-12-18 14:17:11,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:17:11,081 INFO L276 IsEmpty]: Start isEmpty. Operand 9134 states and 21367 transitions. [2019-12-18 14:17:11,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 14:17:11,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:17:11,092 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:17:11,092 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:17:11,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:17:11,093 INFO L82 PathProgramCache]: Analyzing trace with hash 123397759, now seen corresponding path program 1 times [2019-12-18 14:17:11,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:17:11,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459767176] [2019-12-18 14:17:11,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:17:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:17:11,193 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:17:11,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459767176] [2019-12-18 14:17:11,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:17:11,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:17:11,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404351894] [2019-12-18 14:17:11,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:17:11,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:17:11,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:17:11,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:17:11,202 INFO L87 Difference]: Start difference. First operand 9134 states and 21367 transitions. Second operand 4 states. [2019-12-18 14:17:11,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:17:11,264 INFO L93 Difference]: Finished difference Result 10236 states and 23868 transitions. [2019-12-18 14:17:11,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:17:11,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-18 14:17:11,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:17:11,280 INFO L225 Difference]: With dead ends: 10236 [2019-12-18 14:17:11,281 INFO L226 Difference]: Without dead ends: 8314 [2019-12-18 14:17:11,283 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:17:11,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8314 states. [2019-12-18 14:17:11,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8314 to 7886. [2019-12-18 14:17:11,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7886 states. [2019-12-18 14:17:11,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7886 states to 7886 states and 18517 transitions. [2019-12-18 14:17:11,419 INFO L78 Accepts]: Start accepts. Automaton has 7886 states and 18517 transitions. Word has length 44 [2019-12-18 14:17:11,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:17:11,420 INFO L462 AbstractCegarLoop]: Abstraction has 7886 states and 18517 transitions. [2019-12-18 14:17:11,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:17:11,420 INFO L276 IsEmpty]: Start isEmpty. Operand 7886 states and 18517 transitions. [2019-12-18 14:17:11,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 14:17:11,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:17:11,429 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] [2019-12-18 14:17:11,429 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:17:11,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:17:11,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1389551641, now seen corresponding path program 2 times [2019-12-18 14:17:11,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:17:11,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062317379] [2019-12-18 14:17:11,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:17:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:17:11,529 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:17:11,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062317379] [2019-12-18 14:17:11,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:17:11,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:17:11,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852857177] [2019-12-18 14:17:11,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:17:11,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:17:11,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:17:11,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:17:11,531 INFO L87 Difference]: Start difference. First operand 7886 states and 18517 transitions. Second operand 5 states. [2019-12-18 14:17:11,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:17:11,594 INFO L93 Difference]: Finished difference Result 6005 states and 14233 transitions. [2019-12-18 14:17:11,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:17:11,594 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-18 14:17:11,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:17:11,595 INFO L225 Difference]: With dead ends: 6005 [2019-12-18 14:17:11,595 INFO L226 Difference]: Without dead ends: 668 [2019-12-18 14:17:11,596 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:17:11,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2019-12-18 14:17:11,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 664. [2019-12-18 14:17:11,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2019-12-18 14:17:11,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1456 transitions. [2019-12-18 14:17:11,605 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1456 transitions. Word has length 44 [2019-12-18 14:17:11,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:17:11,605 INFO L462 AbstractCegarLoop]: Abstraction has 664 states and 1456 transitions. [2019-12-18 14:17:11,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:17:11,605 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1456 transitions. [2019-12-18 14:17:11,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 14:17:11,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:17:11,606 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:17:11,607 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:17:11,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:17:11,607 INFO L82 PathProgramCache]: Analyzing trace with hash 256933109, now seen corresponding path program 1 times [2019-12-18 14:17:11,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:17:11,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277990560] [2019-12-18 14:17:11,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:17:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:17:11,725 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:17:11,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277990560] [2019-12-18 14:17:11,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:17:11,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:17:11,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157792789] [2019-12-18 14:17:11,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 14:17:11,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:17:11,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 14:17:11,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:17:11,728 INFO L87 Difference]: Start difference. First operand 664 states and 1456 transitions. Second operand 8 states. [2019-12-18 14:17:11,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:17:11,985 INFO L93 Difference]: Finished difference Result 1207 states and 2594 transitions. [2019-12-18 14:17:11,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:17:11,985 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-12-18 14:17:11,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:17:11,987 INFO L225 Difference]: With dead ends: 1207 [2019-12-18 14:17:11,987 INFO L226 Difference]: Without dead ends: 900 [2019-12-18 14:17:11,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:17:11,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2019-12-18 14:17:11,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 738. [2019-12-18 14:17:11,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-12-18 14:17:12,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1584 transitions. [2019-12-18 14:17:12,000 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1584 transitions. Word has length 60 [2019-12-18 14:17:12,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:17:12,000 INFO L462 AbstractCegarLoop]: Abstraction has 738 states and 1584 transitions. [2019-12-18 14:17:12,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 14:17:12,000 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1584 transitions. [2019-12-18 14:17:12,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 14:17:12,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:17:12,002 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:17:12,002 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:17:12,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:17:12,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1155043701, now seen corresponding path program 2 times [2019-12-18 14:17:12,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:17:12,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221800565] [2019-12-18 14:17:12,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:17:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:17:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:17:12,185 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:17:12,186 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:17:12,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y~0_249 0) (= 0 v_~y$w_buff0~0_205) (= v_~y$w_buff0_used~0_843 0) (= v_~y$w_buff1_used~0_439 0) (= 0 v_~weak$$choice0~0_156) (= v_~main$tmp_guard1~0_42 0) (= |v_#NULL.offset_6| 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1731~0.base_28| 4) |v_#length_15|) (= v_~main$tmp_guard0~0_27 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1731~0.base_28| 1) |v_#valid_53|) (= 0 v_~__unbuffered_p0_EAX~0_77) (= 0 |v_ULTIMATE.start_main_~#t1731~0.offset_20|) (= v_~__unbuffered_p0_EBX~0_51 0) (= v_~y$read_delayed~0_6 0) (= v_~weak$$choice2~0_238 0) (= v_~y$r_buff0_thd0~0_100 0) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_#NULL.base_6|) (= 0 v_~y$r_buff1_thd2~0_306) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1731~0.base_28| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1731~0.base_28|) |v_ULTIMATE.start_main_~#t1731~0.offset_20| 0)) |v_#memory_int_13|) (= v_~x~0_52 0) (= 0 v_~y$r_buff0_thd2~0_438) (= v_~y$r_buff1_thd1~0_261 0) (= 0 v_~__unbuffered_cnt~0_49) (= v_~__unbuffered_p1_EBX~0_47 0) (= 0 v_~__unbuffered_p1_EAX~0_65) (= v_~y$w_buff1~0_192 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$flush_delayed~0_191 0) (= v_~y$mem_tmp~0_167 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1731~0.base_28|) (= v_~y$r_buff0_thd1~0_295 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1731~0.base_28|) 0) (= v_~y$r_buff1_thd0~0_204 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_843, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_~#t1732~0.base=|v_ULTIMATE.start_main_~#t1732~0.base_17|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_14|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ULTIMATE.start_main_~#t1731~0.offset=|v_ULTIMATE.start_main_~#t1731~0.offset_20|, ULTIMATE.start_main_~#t1731~0.base=|v_ULTIMATE.start_main_~#t1731~0.base_28|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_261, ~y$mem_tmp~0=v_~y$mem_tmp~0_167, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_77, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_65, ~y$w_buff0~0=v_~y$w_buff0~0_205, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_295, ~y$flush_delayed~0=v_~y$flush_delayed~0_191, #length=|v_#length_15|, ~y~0=v_~y~0_249, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_47, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_51, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_132|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_103|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_147|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_85|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_306, ~weak$$choice0~0=v_~weak$$choice0~0_156, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_115|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_29|, ~y$w_buff1~0=v_~y$w_buff1~0_192, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_100, #valid=|v_#valid_53|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_438, #memory_int=|v_#memory_int_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, ULTIMATE.start_main_~#t1732~0.offset=|v_ULTIMATE.start_main_~#t1732~0.offset_14|, ~weak$$choice2~0=v_~weak$$choice2~0_238, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_204, ~x~0=v_~x~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_439} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t1732~0.base, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1731~0.offset, ULTIMATE.start_main_~#t1731~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1732~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 14:17:12,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L813-1-->L815: Formula: (and (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1732~0.base_13| 4)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1732~0.base_13|) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1732~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t1732~0.base_13| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1732~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1732~0.base_13|) |v_ULTIMATE.start_main_~#t1732~0.offset_11| 1))) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1732~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t1732~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1732~0.base=|v_ULTIMATE.start_main_~#t1732~0.base_13|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1732~0.offset=|v_ULTIMATE.start_main_~#t1732~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1732~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1732~0.offset] because there is no mapped edge [2019-12-18 14:17:12,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [862] [862] P1ENTRY-->L5-3: Formula: (and (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| 1) (= v_~y$w_buff0~0_39 v_~y$w_buff1~0_51) (= 1 v_~y$w_buff0~0_38) (= |v_P1Thread1of1ForFork1_#in~arg.offset_8| v_P1Thread1of1ForFork1_~arg.offset_8) (= v_~y$w_buff0_used~0_162 1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_10) (= (mod v_~y$w_buff1_used~0_84 256) 0) (= v_~y$w_buff1_used~0_84 v_~y$w_buff0_used~0_163) (= v_P1Thread1of1ForFork1_~arg.base_8 |v_P1Thread1of1ForFork1_#in~arg.base_8|)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_163, ~y$w_buff0~0=v_~y$w_buff0~0_39, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_10, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_162, ~y$w_buff1~0=v_~y$w_buff1~0_51, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_8|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_8, ~y$w_buff0~0=v_~y$w_buff0~0_38, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 14:17:12,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L775-2-->L775-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1558430829 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1558430829 256)))) (or (and (not .cse0) (= ~y$w_buff0~0_In-1558430829 |P1Thread1of1ForFork1_#t~ite28_Out-1558430829|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff1~0_In-1558430829 |P1Thread1of1ForFork1_#t~ite28_Out-1558430829|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1558430829, ~y$w_buff1~0=~y$w_buff1~0_In-1558430829, ~y$w_buff0~0=~y$w_buff0~0_In-1558430829, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1558430829} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1558430829, ~y$w_buff1~0=~y$w_buff1~0_In-1558430829, ~y$w_buff0~0=~y$w_buff0~0_In-1558430829, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1558430829, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1558430829|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 14:17:12,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L775-4-->L776: Formula: (= v_~y~0_77 |v_P1Thread1of1ForFork1_#t~ite28_10|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_10|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_13|, ~y~0=v_~y~0_77, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~y~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 14:17:12,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L780-->L781: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_44 256))) (= v_~y$r_buff0_thd2~0_85 v_~y$r_buff0_thd2~0_84)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_44} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_84, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_11|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_11|, ~weak$$choice2~0=v_~weak$$choice2~0_44} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-18 14:17:12,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-252834161 256)))) (or (and (= ~y~0_In-252834161 |P1Thread1of1ForFork1_#t~ite48_Out-252834161|) .cse0) (and (= |P1Thread1of1ForFork1_#t~ite48_Out-252834161| ~y$mem_tmp~0_In-252834161) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-252834161, ~y$flush_delayed~0=~y$flush_delayed~0_In-252834161, ~y~0=~y~0_In-252834161} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-252834161, ~y$flush_delayed~0=~y$flush_delayed~0_In-252834161, ~y~0=~y~0_In-252834161, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out-252834161|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-18 14:17:12,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L791-->L791-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-396330828 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-396330828 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-396330828 |P1Thread1of1ForFork1_#t~ite51_Out-396330828|)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite51_Out-396330828|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-396330828, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-396330828} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-396330828, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-396330828|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-396330828} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-18 14:17:12,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L792-->L792-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In953230285 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In953230285 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In953230285 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In953230285 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In953230285 |P1Thread1of1ForFork1_#t~ite52_Out953230285|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite52_Out953230285|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In953230285, ~y$w_buff0_used~0=~y$w_buff0_used~0_In953230285, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In953230285, ~y$w_buff1_used~0=~y$w_buff1_used~0_In953230285} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In953230285, ~y$w_buff0_used~0=~y$w_buff0_used~0_In953230285, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out953230285|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In953230285, ~y$w_buff1_used~0=~y$w_buff1_used~0_In953230285} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-18 14:17:12,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L793-->L794: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-752931439 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-752931439 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd2~0_Out-752931439)) (and (= ~y$r_buff0_thd2~0_In-752931439 ~y$r_buff0_thd2~0_Out-752931439) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-752931439, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-752931439} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-752931439|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-752931439, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-752931439} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 14:17:12,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L794-->L794-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-1430471973 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-1430471973 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1430471973 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1430471973 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-1430471973 |P1Thread1of1ForFork1_#t~ite54_Out-1430471973|) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite54_Out-1430471973| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1430471973, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1430471973, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1430471973, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1430471973} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1430471973, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1430471973, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1430471973, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-1430471973|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1430471973} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-18 14:17:12,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~y$r_buff1_thd2~0_119 |v_P1Thread1of1ForFork1_#t~ite54_20|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_20|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_119, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_19|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 14:17:12,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L747-->L747-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In2143837876 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite25_Out2143837876| ~y$mem_tmp~0_In2143837876) (not .cse0)) (and .cse0 (= ~y~0_In2143837876 |P0Thread1of1ForFork0_#t~ite25_Out2143837876|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In2143837876, ~y$flush_delayed~0=~y$flush_delayed~0_In2143837876, ~y~0=~y~0_In2143837876} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In2143837876, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out2143837876|, ~y$flush_delayed~0=~y$flush_delayed~0_In2143837876, ~y~0=~y~0_In2143837876} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-18 14:17:12,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L747-2-->P0EXIT: Formula: (and (= v_~y~0_124 |v_P0Thread1of1ForFork0_#t~ite25_20|) (= v_~__unbuffered_cnt~0_26 (+ v_~__unbuffered_cnt~0_27 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= 0 v_~y$flush_delayed~0_78) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_19|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_78, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~y~0=v_~y~0_124} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~y$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-18 14:17:12,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L819-->L821-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_32 256)) (= 0 (mod v_~y$w_buff0_used~0_212 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_212, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_212, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 14:17:12,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L821-2-->L821-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1852539237 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1852539237 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite57_Out-1852539237| ~y~0_In-1852539237) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~y$w_buff1~0_In-1852539237 |ULTIMATE.start_main_#t~ite57_Out-1852539237|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1852539237, ~y~0=~y~0_In-1852539237, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1852539237, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1852539237} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1852539237, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-1852539237|, ~y~0=~y~0_In-1852539237, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1852539237, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1852539237} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-18 14:17:12,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-4-->L822: Formula: (= v_~y~0_22 |v_ULTIMATE.start_main_#t~ite57_9|) InVars {ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_9|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_10|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_8|, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~y~0] because there is no mapped edge [2019-12-18 14:17:12,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-142868192 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-142868192 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite59_Out-142868192| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite59_Out-142868192| ~y$w_buff0_used~0_In-142868192) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-142868192, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-142868192} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-142868192, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-142868192, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-142868192|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-18 14:17:12,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [935] [935] L823-->L823-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In-265383138 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-265383138 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-265383138 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-265383138 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-265383138 |ULTIMATE.start_main_#t~ite60_Out-265383138|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite60_Out-265383138|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-265383138, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-265383138, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-265383138, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-265383138} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-265383138|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-265383138, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-265383138, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-265383138, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-265383138} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-18 14:17:12,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-217771445 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-217771445 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out-217771445| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In-217771445 |ULTIMATE.start_main_#t~ite61_Out-217771445|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-217771445, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-217771445} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-217771445|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-217771445, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-217771445} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-18 14:17:12,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L825-->L825-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1998443861 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1998443861 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1998443861 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In1998443861 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite62_Out1998443861| ~y$r_buff1_thd0~0_In1998443861)) (and (= |ULTIMATE.start_main_#t~ite62_Out1998443861| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1998443861, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1998443861, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1998443861, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1998443861} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1998443861|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1998443861, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1998443861, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1998443861, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1998443861} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-18 14:17:12,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [969] [969] L825-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_20 0) (= v_~__unbuffered_p1_EBX~0_25 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= 1 v_~__unbuffered_p0_EAX~0_55) (= v_~y$r_buff1_thd0~0_175 |v_ULTIMATE.start_main_#t~ite62_45|) (= v_~__unbuffered_p0_EBX~0_29 0) (= 1 v_~__unbuffered_p1_EAX~0_36)) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_55, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_55, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_175, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:17:12,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:17:12 BasicIcfg [2019-12-18 14:17:12,353 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:17:12,355 INFO L168 Benchmark]: Toolchain (without parser) took 92009.70 ms. Allocated memory was 137.9 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 100.0 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-18 14:17:12,356 INFO L168 Benchmark]: CDTParser took 1.66 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 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:17:12,358 INFO L168 Benchmark]: CACSL2BoogieTranslator took 744.03 ms. Allocated memory was 137.9 MB in the beginning and 203.4 MB in the end (delta: 65.5 MB). Free memory was 99.8 MB in the beginning and 156.7 MB in the end (delta: -56.9 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-18 14:17:12,358 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.57 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 153.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-18 14:17:12,359 INFO L168 Benchmark]: Boogie Preprocessor took 42.27 ms. Allocated memory is still 203.4 MB. Free memory was 153.3 MB in the beginning and 151.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 14:17:12,359 INFO L168 Benchmark]: RCFGBuilder took 1024.51 ms. Allocated memory is still 203.4 MB. Free memory was 151.3 MB in the beginning and 98.2 MB in the end (delta: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 7.1 GB. [2019-12-18 14:17:12,360 INFO L168 Benchmark]: TraceAbstraction took 90126.71 ms. Allocated memory was 203.4 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 97.6 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-18 14:17:12,366 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.66 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 744.03 ms. Allocated memory was 137.9 MB in the beginning and 203.4 MB in the end (delta: 65.5 MB). Free memory was 99.8 MB in the beginning and 156.7 MB in the end (delta: -56.9 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.57 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 153.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.27 ms. Allocated memory is still 203.4 MB. Free memory was 153.3 MB in the beginning and 151.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1024.51 ms. Allocated memory is still 203.4 MB. Free memory was 151.3 MB in the beginning and 98.2 MB in the end (delta: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 90126.71 ms. Allocated memory was 203.4 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 97.6 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 179 ProgramPointsBefore, 105 ProgramPointsAfterwards, 228 TransitionsBefore, 129 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 28 ChoiceCompositions, 9059 VarBasedMoverChecksPositive, 283 VarBasedMoverChecksNegative, 68 SemBasedMoverChecksPositive, 299 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 125257 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t1731, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] FCALL, FORK 0 pthread_create(&t1732, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = (_Bool)1 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 y$flush_delayed = weak$$choice2 [L774] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L776] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L777] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L778] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L779] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L779] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] 2 y = y$flush_delayed ? y$mem_tmp : y [L784] 2 y$flush_delayed = (_Bool)0 [L787] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 x = 1 [L732] 1 __unbuffered_p0_EAX = x [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 y$flush_delayed = weak$$choice2 [L738] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L739] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L740] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L741] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L742] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L745] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 173 locations, 2 error locations. Result: UNSAFE, OverallTime: 89.7s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 22.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5358 SDtfs, 7032 SDslu, 12442 SDs, 0 SdLazy, 6606 SolverSat, 300 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111346occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 56.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 387722 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 614 NumberOfCodeBlocks, 614 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 534 ConstructedInterpolants, 0 QuantifiedInterpolants, 59873 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...