/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix009_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 00:31:47,923 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 00:31:47,925 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 00:31:47,938 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 00:31:47,938 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 00:31:47,939 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 00:31:47,941 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 00:31:47,943 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 00:31:47,945 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 00:31:47,945 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 00:31:47,946 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 00:31:47,947 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 00:31:47,948 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 00:31:47,949 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 00:31:47,950 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 00:31:47,951 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 00:31:47,952 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 00:31:47,952 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 00:31:47,954 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 00:31:47,956 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 00:31:47,958 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 00:31:47,959 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 00:31:47,960 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 00:31:47,961 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 00:31:47,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 00:31:47,964 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 00:31:47,964 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 00:31:47,965 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 00:31:47,965 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 00:31:47,966 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 00:31:47,966 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 00:31:47,967 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 00:31:47,968 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 00:31:47,969 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 00:31:47,969 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 00:31:47,970 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 00:31:47,970 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 00:31:47,970 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 00:31:47,971 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 00:31:47,972 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 00:31:47,972 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 00:31:47,973 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2019-12-19 00:31:47,987 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 00:31:47,988 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 00:31:47,989 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 00:31:47,989 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 00:31:47,989 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 00:31:47,990 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 00:31:47,990 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 00:31:47,990 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 00:31:47,990 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 00:31:47,990 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 00:31:47,991 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 00:31:47,991 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 00:31:47,991 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 00:31:47,991 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 00:31:47,991 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 00:31:47,991 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 00:31:47,992 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 00:31:47,992 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 00:31:47,992 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 00:31:47,992 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 00:31:47,993 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 00:31:47,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 00:31:47,993 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 00:31:47,993 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 00:31:47,993 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 00:31:47,993 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 00:31:47,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 00:31:47,994 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 00:31:47,994 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 00:31:47,994 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 00:31:48,298 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 00:31:48,317 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 00:31:48,323 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 00:31:48,324 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 00:31:48,325 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 00:31:48,326 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix009_power.opt.i [2019-12-19 00:31:48,401 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ade17c92/d715487193fa4d4e86338c29781465da/FLAG7cbdf94d0 [2019-12-19 00:31:48,986 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 00:31:48,987 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009_power.opt.i [2019-12-19 00:31:49,002 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ade17c92/d715487193fa4d4e86338c29781465da/FLAG7cbdf94d0 [2019-12-19 00:31:49,258 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ade17c92/d715487193fa4d4e86338c29781465da [2019-12-19 00:31:49,271 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 00:31:49,272 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 00:31:49,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 00:31:49,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 00:31:49,277 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 00:31:49,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 12:31:49" (1/1) ... [2019-12-19 00:31:49,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745d7f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:31:49, skipping insertion in model container [2019-12-19 00:31:49,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 12:31:49" (1/1) ... [2019-12-19 00:31:49,289 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 00:31:49,357 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 00:31:49,941 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 00:31:49,952 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 00:31:50,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 00:31:50,097 INFO L208 MainTranslator]: Completed translation [2019-12-19 00:31:50,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:31:50 WrapperNode [2019-12-19 00:31:50,098 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 00:31:50,099 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 00:31:50,099 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 00:31:50,099 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 00:31:50,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:31:50" (1/1) ... [2019-12-19 00:31:50,130 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:31:50" (1/1) ... [2019-12-19 00:31:50,166 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 00:31:50,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 00:31:50,167 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 00:31:50,167 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 00:31:50,177 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:31:50" (1/1) ... [2019-12-19 00:31:50,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:31:50" (1/1) ... [2019-12-19 00:31:50,182 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:31:50" (1/1) ... [2019-12-19 00:31:50,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:31:50" (1/1) ... [2019-12-19 00:31:50,194 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:31:50" (1/1) ... [2019-12-19 00:31:50,199 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:31:50" (1/1) ... [2019-12-19 00:31:50,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:31:50" (1/1) ... [2019-12-19 00:31:50,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 00:31:50,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 00:31:50,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 00:31:50,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 00:31:50,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:31:50" (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-19 00:31:50,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 00:31:50,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 00:31:50,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 00:31:50,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 00:31:50,295 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 00:31:50,296 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 00:31:50,296 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 00:31:50,297 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 00:31:50,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 00:31:50,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 00:31:50,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 00:31:50,301 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-19 00:31:51,272 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 00:31:51,273 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 00:31:51,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:31:51 BoogieIcfgContainer [2019-12-19 00:31:51,274 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 00:31:51,276 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 00:31:51,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 00:31:51,279 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 00:31:51,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 12:31:49" (1/3) ... [2019-12-19 00:31:51,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6badaf0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 12:31:51, skipping insertion in model container [2019-12-19 00:31:51,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:31:50" (2/3) ... [2019-12-19 00:31:51,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6badaf0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 12:31:51, skipping insertion in model container [2019-12-19 00:31:51,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:31:51" (3/3) ... [2019-12-19 00:31:51,283 INFO L109 eAbstractionObserver]: Analyzing ICFG mix009_power.opt.i [2019-12-19 00:31:51,294 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 00:31:51,294 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 00:31:51,301 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 00:31:51,303 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 00:31:51,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,347 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,348 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,392 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,392 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,392 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,393 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,393 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,421 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,423 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,430 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,431 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,433 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:51,450 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 00:31:51,471 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 00:31:51,471 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 00:31:51,471 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 00:31:51,472 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 00:31:51,472 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 00:31:51,472 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 00:31:51,472 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 00:31:51,472 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 00:31:51,488 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 180 places, 229 transitions [2019-12-19 00:32:00,501 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80074 states. [2019-12-19 00:32:00,503 INFO L276 IsEmpty]: Start isEmpty. Operand 80074 states. [2019-12-19 00:32:00,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-19 00:32:00,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:00,514 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] [2019-12-19 00:32:00,515 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:00,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:00,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1419186758, now seen corresponding path program 1 times [2019-12-19 00:32:00,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:00,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142627293] [2019-12-19 00:32:00,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:00,849 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-19 00:32:00,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142627293] [2019-12-19 00:32:00,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:00,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:32:00,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254302095] [2019-12-19 00:32:00,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:32:00,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:00,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:32:00,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:32:00,874 INFO L87 Difference]: Start difference. First operand 80074 states. Second operand 4 states. [2019-12-19 00:32:02,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:02,361 INFO L93 Difference]: Finished difference Result 80714 states and 324639 transitions. [2019-12-19 00:32:02,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 00:32:02,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-19 00:32:02,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:02,827 INFO L225 Difference]: With dead ends: 80714 [2019-12-19 00:32:02,827 INFO L226 Difference]: Without dead ends: 59002 [2019-12-19 00:32:02,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:32:06,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59002 states. [2019-12-19 00:32:07,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59002 to 59002. [2019-12-19 00:32:07,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59002 states. [2019-12-19 00:32:10,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59002 states to 59002 states and 240127 transitions. [2019-12-19 00:32:10,307 INFO L78 Accepts]: Start accepts. Automaton has 59002 states and 240127 transitions. Word has length 41 [2019-12-19 00:32:10,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:10,308 INFO L462 AbstractCegarLoop]: Abstraction has 59002 states and 240127 transitions. [2019-12-19 00:32:10,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:32:10,308 INFO L276 IsEmpty]: Start isEmpty. Operand 59002 states and 240127 transitions. [2019-12-19 00:32:10,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-19 00:32:10,321 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:10,321 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] [2019-12-19 00:32:10,322 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:10,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:10,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1596822137, now seen corresponding path program 1 times [2019-12-19 00:32:10,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:10,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347746622] [2019-12-19 00:32:10,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:10,451 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-19 00:32:10,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347746622] [2019-12-19 00:32:10,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:10,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:32:10,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373264798] [2019-12-19 00:32:10,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:32:10,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:10,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:32:10,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:32:10,455 INFO L87 Difference]: Start difference. First operand 59002 states and 240127 transitions. Second operand 5 states. [2019-12-19 00:32:11,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:11,821 INFO L93 Difference]: Finished difference Result 95596 states and 363718 transitions. [2019-12-19 00:32:11,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:32:11,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-19 00:32:11,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:12,284 INFO L225 Difference]: With dead ends: 95596 [2019-12-19 00:32:12,284 INFO L226 Difference]: Without dead ends: 95044 [2019-12-19 00:32:12,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 00:32:13,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95044 states. [2019-12-19 00:32:18,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95044 to 93166. [2019-12-19 00:32:18,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93166 states. [2019-12-19 00:32:18,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93166 states to 93166 states and 356304 transitions. [2019-12-19 00:32:18,916 INFO L78 Accepts]: Start accepts. Automaton has 93166 states and 356304 transitions. Word has length 49 [2019-12-19 00:32:18,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:18,917 INFO L462 AbstractCegarLoop]: Abstraction has 93166 states and 356304 transitions. [2019-12-19 00:32:18,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:32:18,918 INFO L276 IsEmpty]: Start isEmpty. Operand 93166 states and 356304 transitions. [2019-12-19 00:32:18,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-19 00:32:18,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:18,926 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:18,926 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:18,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:18,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1178649803, now seen corresponding path program 1 times [2019-12-19 00:32:18,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:18,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913954302] [2019-12-19 00:32:18,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:19,026 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-19 00:32:19,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913954302] [2019-12-19 00:32:19,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:19,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:32:19,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212496908] [2019-12-19 00:32:19,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:32:19,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:19,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:32:19,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:32:19,030 INFO L87 Difference]: Start difference. First operand 93166 states and 356304 transitions. Second operand 5 states. [2019-12-19 00:32:20,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:20,106 INFO L93 Difference]: Finished difference Result 118510 states and 442885 transitions. [2019-12-19 00:32:20,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:32:20,107 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-12-19 00:32:20,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:20,465 INFO L225 Difference]: With dead ends: 118510 [2019-12-19 00:32:20,465 INFO L226 Difference]: Without dead ends: 118062 [2019-12-19 00:32:20,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 00:32:25,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118062 states. [2019-12-19 00:32:26,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118062 to 104155. [2019-12-19 00:32:26,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104155 states. [2019-12-19 00:32:27,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104155 states to 104155 states and 394238 transitions. [2019-12-19 00:32:27,743 INFO L78 Accepts]: Start accepts. Automaton has 104155 states and 394238 transitions. Word has length 50 [2019-12-19 00:32:27,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:27,744 INFO L462 AbstractCegarLoop]: Abstraction has 104155 states and 394238 transitions. [2019-12-19 00:32:27,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:32:27,744 INFO L276 IsEmpty]: Start isEmpty. Operand 104155 states and 394238 transitions. [2019-12-19 00:32:27,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-19 00:32:27,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:27,757 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:27,758 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:27,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:27,758 INFO L82 PathProgramCache]: Analyzing trace with hash -305372623, now seen corresponding path program 1 times [2019-12-19 00:32:27,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:27,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343188727] [2019-12-19 00:32:27,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:27,860 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-19 00:32:27,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343188727] [2019-12-19 00:32:27,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:27,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 00:32:27,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863700889] [2019-12-19 00:32:27,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 00:32:27,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:27,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 00:32:27,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 00:32:27,863 INFO L87 Difference]: Start difference. First operand 104155 states and 394238 transitions. Second operand 3 states. [2019-12-19 00:32:28,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:28,676 INFO L93 Difference]: Finished difference Result 170913 states and 627060 transitions. [2019-12-19 00:32:28,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 00:32:28,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-19 00:32:28,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:29,105 INFO L225 Difference]: With dead ends: 170913 [2019-12-19 00:32:29,105 INFO L226 Difference]: Without dead ends: 170913 [2019-12-19 00:32:29,106 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-19 00:32:35,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170913 states. [2019-12-19 00:32:37,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170913 to 157191. [2019-12-19 00:32:37,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157191 states. [2019-12-19 00:32:37,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157191 states to 157191 states and 581292 transitions. [2019-12-19 00:32:37,939 INFO L78 Accepts]: Start accepts. Automaton has 157191 states and 581292 transitions. Word has length 52 [2019-12-19 00:32:37,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:37,939 INFO L462 AbstractCegarLoop]: Abstraction has 157191 states and 581292 transitions. [2019-12-19 00:32:37,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 00:32:37,939 INFO L276 IsEmpty]: Start isEmpty. Operand 157191 states and 581292 transitions. [2019-12-19 00:32:37,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-19 00:32:37,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:37,965 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] [2019-12-19 00:32:37,965 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:37,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:37,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1580132604, now seen corresponding path program 1 times [2019-12-19 00:32:37,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:37,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552646203] [2019-12-19 00:32:37,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:38,058 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-19 00:32:38,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552646203] [2019-12-19 00:32:38,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:38,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:32:38,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510216219] [2019-12-19 00:32:38,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:32:38,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:38,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:32:38,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:32:38,062 INFO L87 Difference]: Start difference. First operand 157191 states and 581292 transitions. Second operand 6 states. [2019-12-19 00:32:40,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:40,925 INFO L93 Difference]: Finished difference Result 212575 states and 766174 transitions. [2019-12-19 00:32:40,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 00:32:40,926 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-19 00:32:40,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:41,488 INFO L225 Difference]: With dead ends: 212575 [2019-12-19 00:32:41,488 INFO L226 Difference]: Without dead ends: 212055 [2019-12-19 00:32:41,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-19 00:32:49,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212055 states. [2019-12-19 00:32:51,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212055 to 157973. [2019-12-19 00:32:51,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157973 states. [2019-12-19 00:32:52,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157973 states to 157973 states and 584229 transitions. [2019-12-19 00:32:52,559 INFO L78 Accepts]: Start accepts. Automaton has 157973 states and 584229 transitions. Word has length 56 [2019-12-19 00:32:52,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:52,560 INFO L462 AbstractCegarLoop]: Abstraction has 157973 states and 584229 transitions. [2019-12-19 00:32:52,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:32:52,560 INFO L276 IsEmpty]: Start isEmpty. Operand 157973 states and 584229 transitions. [2019-12-19 00:32:52,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-19 00:32:52,581 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:52,581 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] [2019-12-19 00:32:52,581 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:52,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:52,582 INFO L82 PathProgramCache]: Analyzing trace with hash 193567859, now seen corresponding path program 1 times [2019-12-19 00:32:52,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:52,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9080622] [2019-12-19 00:32:52,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:52,670 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-19 00:32:52,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9080622] [2019-12-19 00:32:52,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:52,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 00:32:52,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754587454] [2019-12-19 00:32:52,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 00:32:52,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:52,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 00:32:52,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 00:32:52,677 INFO L87 Difference]: Start difference. First operand 157973 states and 584229 transitions. Second operand 3 states. [2019-12-19 00:32:53,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:53,869 INFO L93 Difference]: Finished difference Result 175833 states and 650717 transitions. [2019-12-19 00:32:53,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 00:32:53,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-19 00:32:53,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:55,747 INFO L225 Difference]: With dead ends: 175833 [2019-12-19 00:32:55,747 INFO L226 Difference]: Without dead ends: 175833 [2019-12-19 00:32:55,748 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-19 00:32:57,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175833 states. [2019-12-19 00:33:07,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175833 to 166853. [2019-12-19 00:33:07,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166853 states. [2019-12-19 00:33:07,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166853 states to 166853 states and 617305 transitions. [2019-12-19 00:33:07,567 INFO L78 Accepts]: Start accepts. Automaton has 166853 states and 617305 transitions. Word has length 56 [2019-12-19 00:33:07,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:33:07,567 INFO L462 AbstractCegarLoop]: Abstraction has 166853 states and 617305 transitions. [2019-12-19 00:33:07,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 00:33:07,568 INFO L276 IsEmpty]: Start isEmpty. Operand 166853 states and 617305 transitions. [2019-12-19 00:33:07,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-19 00:33:07,587 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:33:07,588 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:33:07,588 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:33:07,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:33:07,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1320483597, now seen corresponding path program 1 times [2019-12-19 00:33:07,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:33:07,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791171493] [2019-12-19 00:33:07,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:33:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:33:07,697 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-19 00:33:07,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791171493] [2019-12-19 00:33:07,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:33:07,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:33:07,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322850892] [2019-12-19 00:33:07,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:33:07,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:33:07,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:33:07,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:33:07,700 INFO L87 Difference]: Start difference. First operand 166853 states and 617305 transitions. Second operand 6 states. [2019-12-19 00:33:10,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:33:10,214 INFO L93 Difference]: Finished difference Result 213770 states and 787341 transitions. [2019-12-19 00:33:10,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:33:10,214 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-19 00:33:10,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:33:10,784 INFO L225 Difference]: With dead ends: 213770 [2019-12-19 00:33:10,784 INFO L226 Difference]: Without dead ends: 213770 [2019-12-19 00:33:10,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 00:33:18,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213770 states. [2019-12-19 00:33:20,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213770 to 193996. [2019-12-19 00:33:20,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193996 states. [2019-12-19 00:33:22,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193996 states to 193996 states and 714237 transitions. [2019-12-19 00:33:22,420 INFO L78 Accepts]: Start accepts. Automaton has 193996 states and 714237 transitions. Word has length 56 [2019-12-19 00:33:22,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:33:22,420 INFO L462 AbstractCegarLoop]: Abstraction has 193996 states and 714237 transitions. [2019-12-19 00:33:22,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:33:22,421 INFO L276 IsEmpty]: Start isEmpty. Operand 193996 states and 714237 transitions. [2019-12-19 00:33:22,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-19 00:33:22,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:33:22,448 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] [2019-12-19 00:33:22,449 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:33:22,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:33:22,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1177532340, now seen corresponding path program 1 times [2019-12-19 00:33:22,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:33:22,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336185348] [2019-12-19 00:33:22,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:33:22,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:33:22,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:33:22,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336185348] [2019-12-19 00:33:22,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:33:22,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 00:33:22,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968046549] [2019-12-19 00:33:22,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 00:33:22,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:33:22,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 00:33:22,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:33:22,604 INFO L87 Difference]: Start difference. First operand 193996 states and 714237 transitions. Second operand 7 states. [2019-12-19 00:33:31,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:33:31,079 INFO L93 Difference]: Finished difference Result 277139 states and 986577 transitions. [2019-12-19 00:33:31,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 00:33:31,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-12-19 00:33:31,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:33:31,786 INFO L225 Difference]: With dead ends: 277139 [2019-12-19 00:33:31,786 INFO L226 Difference]: Without dead ends: 277139 [2019-12-19 00:33:31,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 00:33:34,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277139 states. [2019-12-19 00:33:37,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277139 to 222095. [2019-12-19 00:33:37,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222095 states. [2019-12-19 00:33:38,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222095 states to 222095 states and 805381 transitions. [2019-12-19 00:33:38,992 INFO L78 Accepts]: Start accepts. Automaton has 222095 states and 805381 transitions. Word has length 56 [2019-12-19 00:33:38,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:33:38,993 INFO L462 AbstractCegarLoop]: Abstraction has 222095 states and 805381 transitions. [2019-12-19 00:33:38,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 00:33:38,993 INFO L276 IsEmpty]: Start isEmpty. Operand 222095 states and 805381 transitions. [2019-12-19 00:33:39,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-19 00:33:39,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:33:39,017 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] [2019-12-19 00:33:39,017 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:33:39,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:33:39,018 INFO L82 PathProgramCache]: Analyzing trace with hash 2065036021, now seen corresponding path program 1 times [2019-12-19 00:33:39,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:33:39,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697546351] [2019-12-19 00:33:39,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:33:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:33:39,067 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-19 00:33:39,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697546351] [2019-12-19 00:33:39,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:33:39,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 00:33:39,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349425312] [2019-12-19 00:33:39,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 00:33:39,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:33:39,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 00:33:39,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 00:33:39,069 INFO L87 Difference]: Start difference. First operand 222095 states and 805381 transitions. Second operand 3 states. [2019-12-19 00:33:46,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:33:46,265 INFO L93 Difference]: Finished difference Result 176991 states and 632039 transitions. [2019-12-19 00:33:46,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 00:33:46,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-19 00:33:46,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:33:46,725 INFO L225 Difference]: With dead ends: 176991 [2019-12-19 00:33:46,725 INFO L226 Difference]: Without dead ends: 176991 [2019-12-19 00:33:46,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-19 00:33:48,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176991 states. [2019-12-19 00:33:50,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176991 to 172179. [2019-12-19 00:33:50,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172179 states. [2019-12-19 00:33:51,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172179 states to 172179 states and 617064 transitions. [2019-12-19 00:33:51,115 INFO L78 Accepts]: Start accepts. Automaton has 172179 states and 617064 transitions. Word has length 56 [2019-12-19 00:33:51,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:33:51,116 INFO L462 AbstractCegarLoop]: Abstraction has 172179 states and 617064 transitions. [2019-12-19 00:33:51,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 00:33:51,116 INFO L276 IsEmpty]: Start isEmpty. Operand 172179 states and 617064 transitions. [2019-12-19 00:33:51,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-19 00:33:51,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:33:51,138 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] [2019-12-19 00:33:51,138 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:33:51,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:33:51,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1638616881, now seen corresponding path program 1 times [2019-12-19 00:33:51,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:33:51,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999762269] [2019-12-19 00:33:51,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:33:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:33:52,216 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-19 00:33:52,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999762269] [2019-12-19 00:33:52,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:33:52,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:33:52,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432668726] [2019-12-19 00:33:52,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:33:52,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:33:52,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:33:52,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:33:52,218 INFO L87 Difference]: Start difference. First operand 172179 states and 617064 transitions. Second operand 6 states. [2019-12-19 00:33:53,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:33:53,742 INFO L93 Difference]: Finished difference Result 216118 states and 757197 transitions. [2019-12-19 00:33:53,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:33:53,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-19 00:33:53,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:33:54,271 INFO L225 Difference]: With dead ends: 216118 [2019-12-19 00:33:54,272 INFO L226 Difference]: Without dead ends: 216118 [2019-12-19 00:33:54,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 00:34:01,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216118 states. [2019-12-19 00:34:04,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216118 to 185519. [2019-12-19 00:34:04,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185519 states. [2019-12-19 00:34:05,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185519 states to 185519 states and 660439 transitions. [2019-12-19 00:34:05,865 INFO L78 Accepts]: Start accepts. Automaton has 185519 states and 660439 transitions. Word has length 57 [2019-12-19 00:34:05,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:34:05,865 INFO L462 AbstractCegarLoop]: Abstraction has 185519 states and 660439 transitions. [2019-12-19 00:34:05,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:34:05,866 INFO L276 IsEmpty]: Start isEmpty. Operand 185519 states and 660439 transitions. [2019-12-19 00:34:05,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-19 00:34:05,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:34:05,882 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] [2019-12-19 00:34:05,882 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:34:05,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:34:05,882 INFO L82 PathProgramCache]: Analyzing trace with hash -751113200, now seen corresponding path program 1 times [2019-12-19 00:34:05,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:34:05,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778007017] [2019-12-19 00:34:05,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:34:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:34:05,953 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-19 00:34:05,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778007017] [2019-12-19 00:34:05,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:34:05,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:34:05,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291685176] [2019-12-19 00:34:05,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:34:05,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:34:05,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:34:05,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:34:05,955 INFO L87 Difference]: Start difference. First operand 185519 states and 660439 transitions. Second operand 4 states. [2019-12-19 00:34:06,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:34:06,095 INFO L93 Difference]: Finished difference Result 24459 states and 76335 transitions. [2019-12-19 00:34:06,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 00:34:06,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-19 00:34:06,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:34:06,134 INFO L225 Difference]: With dead ends: 24459 [2019-12-19 00:34:06,134 INFO L226 Difference]: Without dead ends: 18440 [2019-12-19 00:34:06,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-19 00:34:06,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18440 states. [2019-12-19 00:34:06,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18440 to 18193. [2019-12-19 00:34:06,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18193 states. [2019-12-19 00:34:06,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18193 states to 18193 states and 54576 transitions. [2019-12-19 00:34:06,369 INFO L78 Accepts]: Start accepts. Automaton has 18193 states and 54576 transitions. Word has length 57 [2019-12-19 00:34:06,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:34:06,369 INFO L462 AbstractCegarLoop]: Abstraction has 18193 states and 54576 transitions. [2019-12-19 00:34:06,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:34:06,369 INFO L276 IsEmpty]: Start isEmpty. Operand 18193 states and 54576 transitions. [2019-12-19 00:34:06,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 00:34:06,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:34:06,373 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, 1, 1, 1, 1, 1, 1] [2019-12-19 00:34:06,374 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:34:06,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:34:06,374 INFO L82 PathProgramCache]: Analyzing trace with hash -914504522, now seen corresponding path program 1 times [2019-12-19 00:34:06,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:34:06,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160054466] [2019-12-19 00:34:06,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:34:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:34:06,428 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-19 00:34:06,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160054466] [2019-12-19 00:34:06,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:34:06,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:34:06,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561863463] [2019-12-19 00:34:06,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:34:06,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:34:06,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:34:06,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:34:06,430 INFO L87 Difference]: Start difference. First operand 18193 states and 54576 transitions. Second operand 4 states. [2019-12-19 00:34:06,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:34:06,698 INFO L93 Difference]: Finished difference Result 23513 states and 70754 transitions. [2019-12-19 00:34:06,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 00:34:06,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-19 00:34:06,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:34:06,731 INFO L225 Difference]: With dead ends: 23513 [2019-12-19 00:34:06,731 INFO L226 Difference]: Without dead ends: 23513 [2019-12-19 00:34:06,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-19 00:34:06,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23513 states. [2019-12-19 00:34:06,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23513 to 21215. [2019-12-19 00:34:06,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21215 states. [2019-12-19 00:34:07,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21215 states to 21215 states and 63561 transitions. [2019-12-19 00:34:07,018 INFO L78 Accepts]: Start accepts. Automaton has 21215 states and 63561 transitions. Word has length 66 [2019-12-19 00:34:07,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:34:07,018 INFO L462 AbstractCegarLoop]: Abstraction has 21215 states and 63561 transitions. [2019-12-19 00:34:07,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:34:07,018 INFO L276 IsEmpty]: Start isEmpty. Operand 21215 states and 63561 transitions. [2019-12-19 00:34:07,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 00:34:07,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:34:07,024 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, 1, 1, 1, 1, 1, 1] [2019-12-19 00:34:07,024 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:34:07,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:34:07,024 INFO L82 PathProgramCache]: Analyzing trace with hash 828305813, now seen corresponding path program 1 times [2019-12-19 00:34:07,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:34:07,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705433407] [2019-12-19 00:34:07,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:34:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:34:07,094 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-19 00:34:07,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705433407] [2019-12-19 00:34:07,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:34:07,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:34:07,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308905122] [2019-12-19 00:34:07,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:34:07,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:34:07,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:34:07,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:34:07,096 INFO L87 Difference]: Start difference. First operand 21215 states and 63561 transitions. Second operand 6 states. [2019-12-19 00:34:07,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:34:07,756 INFO L93 Difference]: Finished difference Result 30327 states and 89101 transitions. [2019-12-19 00:34:07,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 00:34:07,756 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-19 00:34:07,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:34:07,799 INFO L225 Difference]: With dead ends: 30327 [2019-12-19 00:34:07,800 INFO L226 Difference]: Without dead ends: 30279 [2019-12-19 00:34:07,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 00:34:07,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30279 states. [2019-12-19 00:34:09,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30279 to 27632. [2019-12-19 00:34:09,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27632 states. [2019-12-19 00:34:09,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27632 states to 27632 states and 81448 transitions. [2019-12-19 00:34:09,172 INFO L78 Accepts]: Start accepts. Automaton has 27632 states and 81448 transitions. Word has length 66 [2019-12-19 00:34:09,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:34:09,172 INFO L462 AbstractCegarLoop]: Abstraction has 27632 states and 81448 transitions. [2019-12-19 00:34:09,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:34:09,172 INFO L276 IsEmpty]: Start isEmpty. Operand 27632 states and 81448 transitions. [2019-12-19 00:34:09,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-19 00:34:09,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:34:09,182 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:34:09,182 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:34:09,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:34:09,182 INFO L82 PathProgramCache]: Analyzing trace with hash 17339334, now seen corresponding path program 1 times [2019-12-19 00:34:09,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:34:09,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405493606] [2019-12-19 00:34:09,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:34:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:34:09,224 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-19 00:34:09,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405493606] [2019-12-19 00:34:09,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:34:09,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 00:34:09,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383275230] [2019-12-19 00:34:09,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 00:34:09,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:34:09,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 00:34:09,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 00:34:09,226 INFO L87 Difference]: Start difference. First operand 27632 states and 81448 transitions. Second operand 3 states. [2019-12-19 00:34:09,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:34:09,382 INFO L93 Difference]: Finished difference Result 30275 states and 87662 transitions. [2019-12-19 00:34:09,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 00:34:09,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-12-19 00:34:09,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:34:09,423 INFO L225 Difference]: With dead ends: 30275 [2019-12-19 00:34:09,423 INFO L226 Difference]: Without dead ends: 30275 [2019-12-19 00:34:09,424 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-19 00:34:09,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30275 states. [2019-12-19 00:34:09,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30275 to 26780. [2019-12-19 00:34:09,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26780 states. [2019-12-19 00:34:09,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26780 states to 26780 states and 76976 transitions. [2019-12-19 00:34:09,779 INFO L78 Accepts]: Start accepts. Automaton has 26780 states and 76976 transitions. Word has length 72 [2019-12-19 00:34:09,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:34:09,779 INFO L462 AbstractCegarLoop]: Abstraction has 26780 states and 76976 transitions. [2019-12-19 00:34:09,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 00:34:09,779 INFO L276 IsEmpty]: Start isEmpty. Operand 26780 states and 76976 transitions. [2019-12-19 00:34:09,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-19 00:34:09,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:34:09,790 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:34:09,791 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:34:09,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:34:09,791 INFO L82 PathProgramCache]: Analyzing trace with hash -709057717, now seen corresponding path program 1 times [2019-12-19 00:34:09,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:34:09,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439926792] [2019-12-19 00:34:09,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:34:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:34:09,868 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-19 00:34:09,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439926792] [2019-12-19 00:34:09,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:34:09,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:34:09,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316192638] [2019-12-19 00:34:09,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:34:09,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:34:09,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:34:09,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:34:09,870 INFO L87 Difference]: Start difference. First operand 26780 states and 76976 transitions. Second operand 5 states. [2019-12-19 00:34:09,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:34:09,957 INFO L93 Difference]: Finished difference Result 10367 states and 25885 transitions. [2019-12-19 00:34:09,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 00:34:09,958 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-12-19 00:34:09,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:34:09,972 INFO L225 Difference]: With dead ends: 10367 [2019-12-19 00:34:09,972 INFO L226 Difference]: Without dead ends: 9062 [2019-12-19 00:34:09,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-19 00:34:09,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9062 states. [2019-12-19 00:34:10,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9062 to 7007. [2019-12-19 00:34:10,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7007 states. [2019-12-19 00:34:10,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7007 states to 7007 states and 17495 transitions. [2019-12-19 00:34:10,098 INFO L78 Accepts]: Start accepts. Automaton has 7007 states and 17495 transitions. Word has length 74 [2019-12-19 00:34:10,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:34:10,098 INFO L462 AbstractCegarLoop]: Abstraction has 7007 states and 17495 transitions. [2019-12-19 00:34:10,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:34:10,098 INFO L276 IsEmpty]: Start isEmpty. Operand 7007 states and 17495 transitions. [2019-12-19 00:34:10,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-19 00:34:10,108 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:34:10,108 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:34:10,109 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:34:10,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:34:10,109 INFO L82 PathProgramCache]: Analyzing trace with hash -59117604, now seen corresponding path program 1 times [2019-12-19 00:34:10,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:34:10,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107458965] [2019-12-19 00:34:10,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:34:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:34:10,239 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-19 00:34:10,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107458965] [2019-12-19 00:34:10,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:34:10,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 00:34:10,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897725010] [2019-12-19 00:34:10,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 00:34:10,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:34:10,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 00:34:10,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:34:10,243 INFO L87 Difference]: Start difference. First operand 7007 states and 17495 transitions. Second operand 7 states. [2019-12-19 00:34:12,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:34:12,506 INFO L93 Difference]: Finished difference Result 13379 states and 32512 transitions. [2019-12-19 00:34:12,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 00:34:12,507 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2019-12-19 00:34:12,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:34:12,522 INFO L225 Difference]: With dead ends: 13379 [2019-12-19 00:34:12,522 INFO L226 Difference]: Without dead ends: 13357 [2019-12-19 00:34:12,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-19 00:34:12,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13357 states. [2019-12-19 00:34:12,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13357 to 11727. [2019-12-19 00:34:12,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11727 states. [2019-12-19 00:34:12,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11727 states to 11727 states and 28811 transitions. [2019-12-19 00:34:12,656 INFO L78 Accepts]: Start accepts. Automaton has 11727 states and 28811 transitions. Word has length 103 [2019-12-19 00:34:12,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:34:12,656 INFO L462 AbstractCegarLoop]: Abstraction has 11727 states and 28811 transitions. [2019-12-19 00:34:12,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 00:34:12,656 INFO L276 IsEmpty]: Start isEmpty. Operand 11727 states and 28811 transitions. [2019-12-19 00:34:12,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-19 00:34:12,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:34:12,673 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:34:12,673 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:34:12,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:34:12,673 INFO L82 PathProgramCache]: Analyzing trace with hash -70433731, now seen corresponding path program 1 times [2019-12-19 00:34:12,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:34:12,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388048543] [2019-12-19 00:34:12,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:34:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:34:12,749 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-19 00:34:12,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388048543] [2019-12-19 00:34:12,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:34:12,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:34:12,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189231217] [2019-12-19 00:34:12,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:34:12,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:34:12,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:34:12,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:34:12,751 INFO L87 Difference]: Start difference. First operand 11727 states and 28811 transitions. Second operand 4 states. [2019-12-19 00:34:13,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:34:13,004 INFO L93 Difference]: Finished difference Result 13008 states and 31435 transitions. [2019-12-19 00:34:13,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 00:34:13,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-12-19 00:34:13,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:34:13,021 INFO L225 Difference]: With dead ends: 13008 [2019-12-19 00:34:13,021 INFO L226 Difference]: Without dead ends: 12944 [2019-12-19 00:34:13,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:34:13,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12944 states. [2019-12-19 00:34:13,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12944 to 12430. [2019-12-19 00:34:13,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12430 states. [2019-12-19 00:34:13,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12430 states to 12430 states and 30202 transitions. [2019-12-19 00:34:13,154 INFO L78 Accepts]: Start accepts. Automaton has 12430 states and 30202 transitions. Word has length 103 [2019-12-19 00:34:13,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:34:13,154 INFO L462 AbstractCegarLoop]: Abstraction has 12430 states and 30202 transitions. [2019-12-19 00:34:13,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:34:13,154 INFO L276 IsEmpty]: Start isEmpty. Operand 12430 states and 30202 transitions. [2019-12-19 00:34:13,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-19 00:34:13,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:34:13,165 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:34:13,166 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:34:13,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:34:13,166 INFO L82 PathProgramCache]: Analyzing trace with hash -2069221445, now seen corresponding path program 1 times [2019-12-19 00:34:13,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:34:13,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083058276] [2019-12-19 00:34:13,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:34:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:34:13,291 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-19 00:34:13,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083058276] [2019-12-19 00:34:13,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:34:13,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 00:34:13,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198261278] [2019-12-19 00:34:13,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 00:34:13,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:34:13,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 00:34:13,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:34:13,299 INFO L87 Difference]: Start difference. First operand 12430 states and 30202 transitions. Second operand 7 states. [2019-12-19 00:34:13,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:34:13,952 INFO L93 Difference]: Finished difference Result 17333 states and 40395 transitions. [2019-12-19 00:34:13,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 00:34:13,953 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2019-12-19 00:34:13,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:34:13,970 INFO L225 Difference]: With dead ends: 17333 [2019-12-19 00:34:13,971 INFO L226 Difference]: Without dead ends: 17333 [2019-12-19 00:34:13,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-19 00:34:13,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17333 states. [2019-12-19 00:34:14,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17333 to 14822. [2019-12-19 00:34:14,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14822 states. [2019-12-19 00:34:14,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14822 states to 14822 states and 35027 transitions. [2019-12-19 00:34:14,148 INFO L78 Accepts]: Start accepts. Automaton has 14822 states and 35027 transitions. Word has length 103 [2019-12-19 00:34:14,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:34:14,149 INFO L462 AbstractCegarLoop]: Abstraction has 14822 states and 35027 transitions. [2019-12-19 00:34:14,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 00:34:14,149 INFO L276 IsEmpty]: Start isEmpty. Operand 14822 states and 35027 transitions. [2019-12-19 00:34:14,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-19 00:34:14,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:34:14,169 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:34:14,169 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:34:14,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:34:14,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1971009306, now seen corresponding path program 1 times [2019-12-19 00:34:14,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:34:14,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682231925] [2019-12-19 00:34:14,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:34:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:34:14,245 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-19 00:34:14,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682231925] [2019-12-19 00:34:14,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:34:14,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:34:14,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801445149] [2019-12-19 00:34:14,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:34:14,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:34:14,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:34:14,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:34:14,247 INFO L87 Difference]: Start difference. First operand 14822 states and 35027 transitions. Second operand 4 states. [2019-12-19 00:34:14,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:34:14,314 INFO L93 Difference]: Finished difference Result 14822 states and 35009 transitions. [2019-12-19 00:34:14,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 00:34:14,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-12-19 00:34:14,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:34:14,334 INFO L225 Difference]: With dead ends: 14822 [2019-12-19 00:34:14,334 INFO L226 Difference]: Without dead ends: 14822 [2019-12-19 00:34:14,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:34:14,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14822 states. [2019-12-19 00:34:14,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14822 to 14501. [2019-12-19 00:34:14,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14501 states. [2019-12-19 00:34:14,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14501 states to 14501 states and 34280 transitions. [2019-12-19 00:34:14,630 INFO L78 Accepts]: Start accepts. Automaton has 14501 states and 34280 transitions. Word has length 103 [2019-12-19 00:34:14,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:34:14,631 INFO L462 AbstractCegarLoop]: Abstraction has 14501 states and 34280 transitions. [2019-12-19 00:34:14,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:34:14,631 INFO L276 IsEmpty]: Start isEmpty. Operand 14501 states and 34280 transitions. [2019-12-19 00:34:14,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-19 00:34:14,644 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:34:14,644 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:34:14,645 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:34:14,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:34:14,645 INFO L82 PathProgramCache]: Analyzing trace with hash -336476230, now seen corresponding path program 1 times [2019-12-19 00:34:14,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:34:14,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478877539] [2019-12-19 00:34:14,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:34:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:34:14,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:34:14,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478877539] [2019-12-19 00:34:14,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:34:14,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:34:14,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48978640] [2019-12-19 00:34:14,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:34:14,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:34:14,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:34:14,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:34:14,717 INFO L87 Difference]: Start difference. First operand 14501 states and 34280 transitions. Second operand 4 states. [2019-12-19 00:34:15,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:34:15,015 INFO L93 Difference]: Finished difference Result 14577 states and 34470 transitions. [2019-12-19 00:34:15,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 00:34:15,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-12-19 00:34:15,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:34:15,033 INFO L225 Difference]: With dead ends: 14577 [2019-12-19 00:34:15,034 INFO L226 Difference]: Without dead ends: 14577 [2019-12-19 00:34:15,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:34:15,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14577 states. [2019-12-19 00:34:15,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14577 to 13987. [2019-12-19 00:34:15,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13987 states. [2019-12-19 00:34:15,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13987 states to 13987 states and 33135 transitions. [2019-12-19 00:34:15,178 INFO L78 Accepts]: Start accepts. Automaton has 13987 states and 33135 transitions. Word has length 103 [2019-12-19 00:34:15,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:34:15,178 INFO L462 AbstractCegarLoop]: Abstraction has 13987 states and 33135 transitions. [2019-12-19 00:34:15,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:34:15,178 INFO L276 IsEmpty]: Start isEmpty. Operand 13987 states and 33135 transitions. [2019-12-19 00:34:15,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-19 00:34:15,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:34:15,190 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:34:15,190 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:34:15,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:34:15,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1879253812, now seen corresponding path program 2 times [2019-12-19 00:34:15,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:34:15,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218088480] [2019-12-19 00:34:15,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:34:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:34:15,307 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-19 00:34:15,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218088480] [2019-12-19 00:34:15,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:34:15,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:34:15,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080268911] [2019-12-19 00:34:15,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:34:15,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:34:15,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:34:15,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:34:15,309 INFO L87 Difference]: Start difference. First operand 13987 states and 33135 transitions. Second operand 5 states. [2019-12-19 00:34:15,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:34:15,380 INFO L93 Difference]: Finished difference Result 13987 states and 33126 transitions. [2019-12-19 00:34:15,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 00:34:15,381 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-12-19 00:34:15,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:34:15,400 INFO L225 Difference]: With dead ends: 13987 [2019-12-19 00:34:15,400 INFO L226 Difference]: Without dead ends: 13987 [2019-12-19 00:34:15,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:34:15,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13987 states. [2019-12-19 00:34:15,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13987 to 13987. [2019-12-19 00:34:15,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13987 states. [2019-12-19 00:34:15,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13987 states to 13987 states and 33126 transitions. [2019-12-19 00:34:15,588 INFO L78 Accepts]: Start accepts. Automaton has 13987 states and 33126 transitions. Word has length 103 [2019-12-19 00:34:15,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:34:15,588 INFO L462 AbstractCegarLoop]: Abstraction has 13987 states and 33126 transitions. [2019-12-19 00:34:15,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:34:15,588 INFO L276 IsEmpty]: Start isEmpty. Operand 13987 states and 33126 transitions. [2019-12-19 00:34:15,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-19 00:34:15,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:34:15,601 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:34:15,601 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:34:15,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:34:15,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1528209803, now seen corresponding path program 1 times [2019-12-19 00:34:15,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:34:15,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567699137] [2019-12-19 00:34:15,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:34:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:34:15,682 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-19 00:34:15,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567699137] [2019-12-19 00:34:15,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:34:15,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:34:15,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171020519] [2019-12-19 00:34:15,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:34:15,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:34:15,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:34:15,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:34:15,684 INFO L87 Difference]: Start difference. First operand 13987 states and 33126 transitions. Second operand 5 states. [2019-12-19 00:34:16,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:34:16,094 INFO L93 Difference]: Finished difference Result 14917 states and 35123 transitions. [2019-12-19 00:34:16,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 00:34:16,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-12-19 00:34:16,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:34:16,113 INFO L225 Difference]: With dead ends: 14917 [2019-12-19 00:34:16,113 INFO L226 Difference]: Without dead ends: 14917 [2019-12-19 00:34:16,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:34:16,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14917 states. [2019-12-19 00:34:16,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14917 to 13954. [2019-12-19 00:34:16,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13954 states. [2019-12-19 00:34:16,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13954 states to 13954 states and 32992 transitions. [2019-12-19 00:34:16,268 INFO L78 Accepts]: Start accepts. Automaton has 13954 states and 32992 transitions. Word has length 103 [2019-12-19 00:34:16,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:34:16,269 INFO L462 AbstractCegarLoop]: Abstraction has 13954 states and 32992 transitions. [2019-12-19 00:34:16,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:34:16,269 INFO L276 IsEmpty]: Start isEmpty. Operand 13954 states and 32992 transitions. [2019-12-19 00:34:16,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-19 00:34:16,283 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:34:16,283 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:34:16,283 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:34:16,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:34:16,284 INFO L82 PathProgramCache]: Analyzing trace with hash -606803679, now seen corresponding path program 2 times [2019-12-19 00:34:16,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:34:16,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425228256] [2019-12-19 00:34:16,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:34:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:34:16,338 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-19 00:34:16,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425228256] [2019-12-19 00:34:16,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:34:16,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 00:34:16,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379250821] [2019-12-19 00:34:16,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 00:34:16,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:34:16,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 00:34:16,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 00:34:16,341 INFO L87 Difference]: Start difference. First operand 13954 states and 32992 transitions. Second operand 3 states. [2019-12-19 00:34:16,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:34:16,410 INFO L93 Difference]: Finished difference Result 16696 states and 39413 transitions. [2019-12-19 00:34:16,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 00:34:16,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-12-19 00:34:16,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:34:16,436 INFO L225 Difference]: With dead ends: 16696 [2019-12-19 00:34:16,436 INFO L226 Difference]: Without dead ends: 16696 [2019-12-19 00:34:16,436 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-19 00:34:16,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16696 states. [2019-12-19 00:34:16,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16696 to 16642. [2019-12-19 00:34:16,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16642 states. [2019-12-19 00:34:16,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16642 states to 16642 states and 39295 transitions. [2019-12-19 00:34:16,688 INFO L78 Accepts]: Start accepts. Automaton has 16642 states and 39295 transitions. Word has length 103 [2019-12-19 00:34:16,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:34:16,689 INFO L462 AbstractCegarLoop]: Abstraction has 16642 states and 39295 transitions. [2019-12-19 00:34:16,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 00:34:16,689 INFO L276 IsEmpty]: Start isEmpty. Operand 16642 states and 39295 transitions. [2019-12-19 00:34:16,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-19 00:34:16,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:34:16,854 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:34:16,855 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:34:16,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:34:16,855 INFO L82 PathProgramCache]: Analyzing trace with hash -395452766, now seen corresponding path program 1 times [2019-12-19 00:34:16,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:34:16,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067279496] [2019-12-19 00:34:16,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:34:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:34:16,934 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-19 00:34:16,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067279496] [2019-12-19 00:34:16,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:34:16,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:34:16,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519119415] [2019-12-19 00:34:16,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:34:16,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:34:16,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:34:16,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:34:16,936 INFO L87 Difference]: Start difference. First operand 16642 states and 39295 transitions. Second operand 6 states. [2019-12-19 00:34:17,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:34:17,558 INFO L93 Difference]: Finished difference Result 19819 states and 46535 transitions. [2019-12-19 00:34:17,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:34:17,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2019-12-19 00:34:17,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:34:17,585 INFO L225 Difference]: With dead ends: 19819 [2019-12-19 00:34:17,586 INFO L226 Difference]: Without dead ends: 19819 [2019-12-19 00:34:17,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-19 00:34:17,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19819 states. [2019-12-19 00:34:17,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19819 to 16677. [2019-12-19 00:34:17,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16677 states. [2019-12-19 00:34:17,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16677 states to 16677 states and 39371 transitions. [2019-12-19 00:34:17,951 INFO L78 Accepts]: Start accepts. Automaton has 16677 states and 39371 transitions. Word has length 103 [2019-12-19 00:34:17,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:34:17,952 INFO L462 AbstractCegarLoop]: Abstraction has 16677 states and 39371 transitions. [2019-12-19 00:34:17,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:34:17,952 INFO L276 IsEmpty]: Start isEmpty. Operand 16677 states and 39371 transitions. [2019-12-19 00:34:17,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-19 00:34:17,980 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:34:17,981 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:34:17,981 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:34:17,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:34:17,982 INFO L82 PathProgramCache]: Analyzing trace with hash 2015950754, now seen corresponding path program 2 times [2019-12-19 00:34:17,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:34:17,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245204949] [2019-12-19 00:34:17,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:34:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:34:18,058 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-19 00:34:18,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245204949] [2019-12-19 00:34:18,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:34:18,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:34:18,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996073576] [2019-12-19 00:34:18,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:34:18,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:34:18,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:34:18,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:34:18,061 INFO L87 Difference]: Start difference. First operand 16677 states and 39371 transitions. Second operand 5 states. [2019-12-19 00:34:18,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:34:18,509 INFO L93 Difference]: Finished difference Result 18781 states and 43674 transitions. [2019-12-19 00:34:18,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 00:34:18,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-12-19 00:34:18,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:34:18,543 INFO L225 Difference]: With dead ends: 18781 [2019-12-19 00:34:18,544 INFO L226 Difference]: Without dead ends: 18781 [2019-12-19 00:34:18,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:34:18,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18781 states. [2019-12-19 00:34:18,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18781 to 16883. [2019-12-19 00:34:18,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16883 states. [2019-12-19 00:34:18,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16883 states to 16883 states and 39797 transitions. [2019-12-19 00:34:18,935 INFO L78 Accepts]: Start accepts. Automaton has 16883 states and 39797 transitions. Word has length 103 [2019-12-19 00:34:18,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:34:18,936 INFO L462 AbstractCegarLoop]: Abstraction has 16883 states and 39797 transitions. [2019-12-19 00:34:18,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:34:18,936 INFO L276 IsEmpty]: Start isEmpty. Operand 16883 states and 39797 transitions. [2019-12-19 00:34:18,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-19 00:34:18,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:34:18,966 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:34:18,966 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:34:18,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:34:18,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1862635831, now seen corresponding path program 1 times [2019-12-19 00:34:18,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:34:18,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542289038] [2019-12-19 00:34:18,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:34:19,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:34:19,232 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-19 00:34:19,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542289038] [2019-12-19 00:34:19,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:34:19,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-19 00:34:19,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592701484] [2019-12-19 00:34:19,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-19 00:34:19,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:34:19,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-19 00:34:19,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-19 00:34:19,236 INFO L87 Difference]: Start difference. First operand 16883 states and 39797 transitions. Second operand 9 states. [2019-12-19 00:34:19,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:34:19,529 INFO L93 Difference]: Finished difference Result 23924 states and 56546 transitions. [2019-12-19 00:34:19,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 00:34:19,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-12-19 00:34:19,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:34:19,560 INFO L225 Difference]: With dead ends: 23924 [2019-12-19 00:34:19,560 INFO L226 Difference]: Without dead ends: 21919 [2019-12-19 00:34:19,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-19 00:34:19,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21919 states. [2019-12-19 00:34:19,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21919 to 19691. [2019-12-19 00:34:19,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19691 states. [2019-12-19 00:34:19,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19691 states to 19691 states and 46272 transitions. [2019-12-19 00:34:19,912 INFO L78 Accepts]: Start accepts. Automaton has 19691 states and 46272 transitions. Word has length 105 [2019-12-19 00:34:19,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:34:19,912 INFO L462 AbstractCegarLoop]: Abstraction has 19691 states and 46272 transitions. [2019-12-19 00:34:19,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-19 00:34:19,913 INFO L276 IsEmpty]: Start isEmpty. Operand 19691 states and 46272 transitions. [2019-12-19 00:34:20,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-19 00:34:20,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:34:20,120 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:34:20,120 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:34:20,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:34:20,121 INFO L82 PathProgramCache]: Analyzing trace with hash 543960296, now seen corresponding path program 1 times [2019-12-19 00:34:20,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:34:20,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932855715] [2019-12-19 00:34:20,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:34:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:34:20,263 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-19 00:34:20,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932855715] [2019-12-19 00:34:20,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:34:20,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 00:34:20,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298246483] [2019-12-19 00:34:20,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 00:34:20,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:34:20,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 00:34:20,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:34:20,266 INFO L87 Difference]: Start difference. First operand 19691 states and 46272 transitions. Second operand 7 states. [2019-12-19 00:34:21,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:34:21,787 INFO L93 Difference]: Finished difference Result 24990 states and 57885 transitions. [2019-12-19 00:34:21,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-19 00:34:21,788 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-12-19 00:34:21,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:34:21,830 INFO L225 Difference]: With dead ends: 24990 [2019-12-19 00:34:21,831 INFO L226 Difference]: Without dead ends: 24938 [2019-12-19 00:34:21,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-19 00:34:21,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24938 states. [2019-12-19 00:34:22,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24938 to 20268. [2019-12-19 00:34:22,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20268 states. [2019-12-19 00:34:22,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20268 states to 20268 states and 47469 transitions. [2019-12-19 00:34:22,209 INFO L78 Accepts]: Start accepts. Automaton has 20268 states and 47469 transitions. Word has length 105 [2019-12-19 00:34:22,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:34:22,209 INFO L462 AbstractCegarLoop]: Abstraction has 20268 states and 47469 transitions. [2019-12-19 00:34:22,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 00:34:22,210 INFO L276 IsEmpty]: Start isEmpty. Operand 20268 states and 47469 transitions. [2019-12-19 00:34:22,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-19 00:34:22,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:34:22,238 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:34:22,238 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:34:22,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:34:22,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1533249047, now seen corresponding path program 1 times [2019-12-19 00:34:22,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:34:22,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51732511] [2019-12-19 00:34:22,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:34:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:34:22,361 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-19 00:34:22,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51732511] [2019-12-19 00:34:22,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:34:22,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 00:34:22,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917763285] [2019-12-19 00:34:22,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 00:34:22,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:34:22,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 00:34:22,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:34:22,364 INFO L87 Difference]: Start difference. First operand 20268 states and 47469 transitions. Second operand 7 states. [2019-12-19 00:34:22,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:34:22,593 INFO L93 Difference]: Finished difference Result 20806 states and 48604 transitions. [2019-12-19 00:34:22,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:34:22,593 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-12-19 00:34:22,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:34:22,620 INFO L225 Difference]: With dead ends: 20806 [2019-12-19 00:34:22,621 INFO L226 Difference]: Without dead ends: 15607 [2019-12-19 00:34:22,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-19 00:34:22,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15607 states. [2019-12-19 00:34:22,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15607 to 15605. [2019-12-19 00:34:22,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15605 states. [2019-12-19 00:34:22,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15605 states to 15605 states and 36838 transitions. [2019-12-19 00:34:22,905 INFO L78 Accepts]: Start accepts. Automaton has 15605 states and 36838 transitions. Word has length 105 [2019-12-19 00:34:22,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:34:22,905 INFO L462 AbstractCegarLoop]: Abstraction has 15605 states and 36838 transitions. [2019-12-19 00:34:22,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 00:34:22,905 INFO L276 IsEmpty]: Start isEmpty. Operand 15605 states and 36838 transitions. [2019-12-19 00:34:22,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-19 00:34:22,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:34:22,925 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:34:22,926 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:34:22,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:34:22,926 INFO L82 PathProgramCache]: Analyzing trace with hash -283821612, now seen corresponding path program 1 times [2019-12-19 00:34:22,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:34:22,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16265069] [2019-12-19 00:34:22,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:34:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:34:23,001 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-19 00:34:23,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16265069] [2019-12-19 00:34:23,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:34:23,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 00:34:23,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532664625] [2019-12-19 00:34:23,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 00:34:23,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:34:23,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 00:34:23,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:34:23,003 INFO L87 Difference]: Start difference. First operand 15605 states and 36838 transitions. Second operand 7 states. [2019-12-19 00:34:23,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:34:23,533 INFO L93 Difference]: Finished difference Result 17207 states and 40245 transitions. [2019-12-19 00:34:23,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:34:23,533 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-12-19 00:34:23,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:34:23,553 INFO L225 Difference]: With dead ends: 17207 [2019-12-19 00:34:23,553 INFO L226 Difference]: Without dead ends: 17207 [2019-12-19 00:34:23,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-19 00:34:23,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17207 states. [2019-12-19 00:34:23,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17207 to 15413. [2019-12-19 00:34:23,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15413 states. [2019-12-19 00:34:23,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15413 states to 15413 states and 36450 transitions. [2019-12-19 00:34:23,796 INFO L78 Accepts]: Start accepts. Automaton has 15413 states and 36450 transitions. Word has length 105 [2019-12-19 00:34:23,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:34:23,796 INFO L462 AbstractCegarLoop]: Abstraction has 15413 states and 36450 transitions. [2019-12-19 00:34:23,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 00:34:23,796 INFO L276 IsEmpty]: Start isEmpty. Operand 15413 states and 36450 transitions. [2019-12-19 00:34:23,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-19 00:34:23,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:34:23,810 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:34:23,810 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:34:23,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:34:23,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1637589431, now seen corresponding path program 2 times [2019-12-19 00:34:23,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:34:23,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28296576] [2019-12-19 00:34:23,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:34:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:34:23,945 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-19 00:34:23,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28296576] [2019-12-19 00:34:23,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:34:23,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 00:34:23,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911823970] [2019-12-19 00:34:23,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 00:34:23,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:34:23,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 00:34:23,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-19 00:34:23,947 INFO L87 Difference]: Start difference. First operand 15413 states and 36450 transitions. Second operand 8 states. [2019-12-19 00:34:24,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:34:24,119 INFO L93 Difference]: Finished difference Result 15746 states and 37174 transitions. [2019-12-19 00:34:24,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:34:24,120 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 105 [2019-12-19 00:34:24,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:34:24,125 INFO L225 Difference]: With dead ends: 15746 [2019-12-19 00:34:24,125 INFO L226 Difference]: Without dead ends: 2898 [2019-12-19 00:34:24,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-19 00:34:24,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2019-12-19 00:34:24,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2896. [2019-12-19 00:34:24,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2896 states. [2019-12-19 00:34:24,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2896 states to 2896 states and 6855 transitions. [2019-12-19 00:34:24,180 INFO L78 Accepts]: Start accepts. Automaton has 2896 states and 6855 transitions. Word has length 105 [2019-12-19 00:34:24,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:34:24,180 INFO L462 AbstractCegarLoop]: Abstraction has 2896 states and 6855 transitions. [2019-12-19 00:34:24,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 00:34:24,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2896 states and 6855 transitions. [2019-12-19 00:34:24,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-19 00:34:24,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:34:24,184 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:34:24,185 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:34:24,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:34:24,185 INFO L82 PathProgramCache]: Analyzing trace with hash -582979528, now seen corresponding path program 1 times [2019-12-19 00:34:24,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:34:24,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302746335] [2019-12-19 00:34:24,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:34:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:34:24,394 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-19 00:34:24,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302746335] [2019-12-19 00:34:24,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:34:24,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-19 00:34:24,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185568194] [2019-12-19 00:34:24,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-19 00:34:24,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:34:24,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-19 00:34:24,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-19 00:34:24,396 INFO L87 Difference]: Start difference. First operand 2896 states and 6855 transitions. Second operand 11 states. [2019-12-19 00:34:24,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:34:24,788 INFO L93 Difference]: Finished difference Result 4398 states and 10179 transitions. [2019-12-19 00:34:24,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 00:34:24,790 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 105 [2019-12-19 00:34:24,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:34:24,795 INFO L225 Difference]: With dead ends: 4398 [2019-12-19 00:34:24,795 INFO L226 Difference]: Without dead ends: 3266 [2019-12-19 00:34:24,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-12-19 00:34:24,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2019-12-19 00:34:24,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 2951. [2019-12-19 00:34:24,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2951 states. [2019-12-19 00:34:24,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2951 states to 2951 states and 6916 transitions. [2019-12-19 00:34:24,823 INFO L78 Accepts]: Start accepts. Automaton has 2951 states and 6916 transitions. Word has length 105 [2019-12-19 00:34:24,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:34:24,824 INFO L462 AbstractCegarLoop]: Abstraction has 2951 states and 6916 transitions. [2019-12-19 00:34:24,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-19 00:34:24,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2951 states and 6916 transitions. [2019-12-19 00:34:24,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-19 00:34:24,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:34:24,826 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:34:24,827 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:34:24,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:34:24,827 INFO L82 PathProgramCache]: Analyzing trace with hash -633160074, now seen corresponding path program 2 times [2019-12-19 00:34:24,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:34:24,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415676284] [2019-12-19 00:34:24,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:34:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 00:34:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 00:34:24,916 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 00:34:24,917 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 00:34:25,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 12:34:25 BasicIcfg [2019-12-19 00:34:25,105 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 00:34:25,108 INFO L168 Benchmark]: Toolchain (without parser) took 155834.49 ms. Allocated memory was 135.8 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 97.6 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 624.9 MB. Max. memory is 7.1 GB. [2019-12-19 00:34:25,109 INFO L168 Benchmark]: CDTParser took 1.56 ms. Allocated memory is still 135.8 MB. Free memory was 117.7 MB in the beginning and 117.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-19 00:34:25,110 INFO L168 Benchmark]: CACSL2BoogieTranslator took 825.27 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 97.4 MB in the beginning and 153.8 MB in the end (delta: -56.4 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2019-12-19 00:34:25,110 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.22 ms. Allocated memory is still 199.8 MB. Free memory was 153.8 MB in the beginning and 150.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-19 00:34:25,111 INFO L168 Benchmark]: Boogie Preprocessor took 42.61 ms. Allocated memory is still 199.8 MB. Free memory was 150.8 MB in the beginning and 148.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-19 00:34:25,113 INFO L168 Benchmark]: RCFGBuilder took 1065.13 ms. Allocated memory is still 199.8 MB. Free memory was 148.0 MB in the beginning and 95.1 MB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2019-12-19 00:34:25,113 INFO L168 Benchmark]: TraceAbstraction took 153829.31 ms. Allocated memory was 199.8 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 94.4 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 557.7 MB. Max. memory is 7.1 GB. [2019-12-19 00:34:25,116 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.56 ms. Allocated memory is still 135.8 MB. Free memory was 117.7 MB in the beginning and 117.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 825.27 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 97.4 MB in the beginning and 153.8 MB in the end (delta: -56.4 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.22 ms. Allocated memory is still 199.8 MB. Free memory was 153.8 MB in the beginning and 150.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.61 ms. Allocated memory is still 199.8 MB. Free memory was 150.8 MB in the beginning and 148.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1065.13 ms. Allocated memory is still 199.8 MB. Free memory was 148.0 MB in the beginning and 95.1 MB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 153829.31 ms. Allocated memory was 199.8 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 94.4 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 557.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L701] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L703] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L704] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L705] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L707] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L709] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L710] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L711] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L712] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L713] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L714] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L715] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L716] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L717] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L718] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L719] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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}] [L720] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L721] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L722] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L723] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L725] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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, z=0] [L726] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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, z=0] [L727] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t243; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t243, ((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, z=0] [L819] 0 pthread_t t244; 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, z=0] [L820] FCALL, FORK 0 pthread_create(&t244, ((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, z=0] [L765] 2 y$w_buff1 = y$w_buff0 [L766] 2 y$w_buff0 = 1 [L767] 2 y$w_buff1_used = y$w_buff0_used [L768] 2 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L770] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L771] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L772] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L773] 2 y$r_buff0_thd2 = (_Bool)1 [L776] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 2 y$flush_delayed = weak$$choice2 [L779] 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=5, 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, z=0] [L780] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__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=5, 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, z=0] [L780] EXPR 2 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=5, 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, z=0] [L780] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__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=5, 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, z=0] [L780] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L781] 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=5, 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, z=0] [L781] 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)) [L782] 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=5, 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, z=0] [L782] 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)) [L783] 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=5, 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, z=0] [L783] 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)) [L784] 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=5, 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, z=0] [L784] 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)) [L785] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) 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=5, 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, z=0] [L785] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L786] 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=5, 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, z=0] [L786] 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)) [L787] 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=5, 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, z=0] [L788] EXPR 2 y$flush_delayed ? y$mem_tmp : 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=5, 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, z=0] [L788] 2 y = y$flush_delayed ? y$mem_tmp : y [L789] 2 y$flush_delayed = (_Bool)0 [L792] 2 __unbuffered_p1_EBX = z 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=5, 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, z=0] [L795] 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=5, 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, z=0] [L731] 1 z = 1 [L734] 1 x = 1 [L737] 1 __unbuffered_p0_EAX = x [L740] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L741] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L742] 1 y$flush_delayed = weak$$choice2 [L743] 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=6, 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, z=1] [L744] 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=6, 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, z=1] [L795] 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) [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used 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=6, weak$$choice2=1, x=1, 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, z=1] [L796] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used 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=6, weak$$choice2=1, x=1, 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=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 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 [L798] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 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=6, weak$$choice2=1, x=1, 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=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L799] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 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=6, weak$$choice2=1, x=1, 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=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 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=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=6, weak$$choice2=1, x=1, 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=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 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) [L745] 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=6, 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, z=1] [L745] 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)) [L746] 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=6, 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, z=1] [L746] 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)) [L747] 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=6, 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, z=1] [L747] 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)) [L748] 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=6, 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, z=1] [L748] 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)) [L749] 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=6, 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, z=1] [L749] 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)) [L750] 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=6, 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, z=1] [L750] 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)) [L751] 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=6, 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, z=1] [L752] EXPR 1 y$flush_delayed ? y$mem_tmp : 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=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=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, z=1] [L752] 1 y = y$flush_delayed ? y$mem_tmp : y [L753] 1 y$flush_delayed = (_Bool)0 [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__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=0, main$tmp_guard1=0, weak$$choice0=6, 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, z=1] [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__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=6, 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, z=1] [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__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=6, 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, z=1] [L826] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__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=6, 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, z=1] [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__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=6, 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, z=1] [L826] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__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=6, 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, z=1] [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__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=6, 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, z=1] [L828] 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 [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__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=6, 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, z=1] [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L830] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__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=6, 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, z=1] [L830] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L833] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__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=6, 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, z=1] [L5] COND TRUE 0 !expression VAL [__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=6, 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, z=1] [L5] 0 __VERIFIER_error() VAL [__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=6, 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, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 174 locations, 2 error locations. Result: UNSAFE, OverallTime: 153.4s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 45.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10845 SDtfs, 11757 SDslu, 24882 SDs, 0 SdLazy, 8788 SolverSat, 596 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 277 GetRequests, 79 SyntacticMatches, 14 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222095occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 93.8s AutomataMinimizationTime, 31 MinimizatonAttempts, 234174 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 2629 NumberOfCodeBlocks, 2629 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2493 ConstructedInterpolants, 0 QuantifiedInterpolants, 597432 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...