/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/rfi010_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 04:05:41,936 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 04:05:41,939 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 04:05:41,957 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 04:05:41,958 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 04:05:41,960 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 04:05:41,962 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 04:05:41,971 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 04:05:41,975 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 04:05:41,978 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 04:05:41,980 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 04:05:41,982 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 04:05:41,982 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 04:05:41,984 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 04:05:41,987 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 04:05:41,988 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 04:05:41,990 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 04:05:41,992 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 04:05:41,994 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 04:05:42,000 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 04:05:42,005 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 04:05:42,009 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 04:05:42,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 04:05:42,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 04:05:42,014 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 04:05:42,014 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 04:05:42,014 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 04:05:42,017 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 04:05:42,018 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 04:05:42,020 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 04:05:42,020 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 04:05:42,020 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 04:05:42,021 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 04:05:42,022 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 04:05:42,024 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 04:05:42,024 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 04:05:42,024 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 04:05:42,025 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 04:05:42,025 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 04:05:42,027 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 04:05:42,029 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 04:05:42,030 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 04:05:42,063 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 04:05:42,063 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 04:05:42,064 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 04:05:42,064 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 04:05:42,065 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 04:05:42,068 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 04:05:42,068 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 04:05:42,068 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 04:05:42,069 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 04:05:42,069 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 04:05:42,069 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 04:05:42,069 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 04:05:42,069 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 04:05:42,070 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 04:05:42,070 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 04:05:42,070 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 04:05:42,070 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 04:05:42,070 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 04:05:42,073 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 04:05:42,073 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 04:05:42,073 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 04:05:42,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 04:05:42,074 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 04:05:42,074 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 04:05:42,074 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 04:05:42,074 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 04:05:42,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 04:05:42,075 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 04:05:42,075 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 04:05:42,075 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 04:05:42,381 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 04:05:42,395 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 04:05:42,398 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 04:05:42,400 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 04:05:42,400 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 04:05:42,401 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi010_power.oepc.i [2019-12-19 04:05:42,471 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdc304517/99be37d753644a5b95fb4bf6117b91c7/FLAG83020914b [2019-12-19 04:05:43,073 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 04:05:43,074 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi010_power.oepc.i [2019-12-19 04:05:43,088 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdc304517/99be37d753644a5b95fb4bf6117b91c7/FLAG83020914b [2019-12-19 04:05:43,297 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdc304517/99be37d753644a5b95fb4bf6117b91c7 [2019-12-19 04:05:43,305 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 04:05:43,307 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 04:05:43,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 04:05:43,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 04:05:43,312 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 04:05:43,313 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 04:05:43" (1/1) ... [2019-12-19 04:05:43,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa21428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:05:43, skipping insertion in model container [2019-12-19 04:05:43,317 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 04:05:43" (1/1) ... [2019-12-19 04:05:43,325 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 04:05:43,370 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 04:05:43,979 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 04:05:43,994 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 04:05:44,061 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 04:05:44,132 INFO L208 MainTranslator]: Completed translation [2019-12-19 04:05:44,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:05:44 WrapperNode [2019-12-19 04:05:44,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 04:05:44,134 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 04:05:44,134 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 04:05:44,134 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 04:05:44,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:05:44" (1/1) ... [2019-12-19 04:05:44,172 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:05:44" (1/1) ... [2019-12-19 04:05:44,208 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 04:05:44,209 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 04:05:44,209 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 04:05:44,209 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 04:05:44,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:05:44" (1/1) ... [2019-12-19 04:05:44,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:05:44" (1/1) ... [2019-12-19 04:05:44,222 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:05:44" (1/1) ... [2019-12-19 04:05:44,223 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:05:44" (1/1) ... [2019-12-19 04:05:44,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:05:44" (1/1) ... [2019-12-19 04:05:44,238 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:05:44" (1/1) ... [2019-12-19 04:05:44,242 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:05:44" (1/1) ... [2019-12-19 04:05:44,247 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 04:05:44,248 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 04:05:44,248 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 04:05:44,248 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 04:05:44,249 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:05:44" (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 04:05:44,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 04:05:44,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 04:05:44,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 04:05:44,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 04:05:44,338 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 04:05:44,338 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 04:05:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 04:05:44,340 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 04:05:44,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 04:05:44,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 04:05:44,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 04:05:44,343 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 04:05:45,375 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 04:05:45,376 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 04:05:45,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 04:05:45 BoogieIcfgContainer [2019-12-19 04:05:45,378 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 04:05:45,379 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 04:05:45,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 04:05:45,383 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 04:05:45,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 04:05:43" (1/3) ... [2019-12-19 04:05:45,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2c5cbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 04:05:45, skipping insertion in model container [2019-12-19 04:05:45,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:05:44" (2/3) ... [2019-12-19 04:05:45,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2c5cbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 04:05:45, skipping insertion in model container [2019-12-19 04:05:45,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 04:05:45" (3/3) ... [2019-12-19 04:05:45,389 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi010_power.oepc.i [2019-12-19 04:05:45,401 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 04:05:45,401 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 04:05:45,419 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 04:05:45,420 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 04:05:45,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,477 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,478 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,517 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,518 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,518 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,518 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,518 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,546 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,548 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,564 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,565 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,568 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:45,585 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 04:05:45,607 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 04:05:45,608 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 04:05:45,608 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 04:05:45,608 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 04:05:45,608 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 04:05:45,608 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 04:05:45,608 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 04:05:45,609 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 04:05:45,624 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 178 places, 227 transitions [2019-12-19 04:05:54,692 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80072 states. [2019-12-19 04:05:54,695 INFO L276 IsEmpty]: Start isEmpty. Operand 80072 states. [2019-12-19 04:05:54,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-19 04:05:54,707 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:05:54,708 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:05:54,708 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:05:54,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:05:54,714 INFO L82 PathProgramCache]: Analyzing trace with hash 71050137, now seen corresponding path program 1 times [2019-12-19 04:05:54,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:05:54,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355902855] [2019-12-19 04:05:54,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:05:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:05:55,092 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 04:05:55,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355902855] [2019-12-19 04:05:55,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:05:55,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:05:55,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919644374] [2019-12-19 04:05:55,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:05:55,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:05:55,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:05:55,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:05:55,124 INFO L87 Difference]: Start difference. First operand 80072 states. Second operand 4 states. [2019-12-19 04:05:57,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:05:57,328 INFO L93 Difference]: Finished difference Result 80712 states and 324637 transitions. [2019-12-19 04:05:57,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 04:05:57,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-19 04:05:57,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:05:57,785 INFO L225 Difference]: With dead ends: 80712 [2019-12-19 04:05:57,785 INFO L226 Difference]: Without dead ends: 59000 [2019-12-19 04:05:57,789 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 04:06:00,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59000 states. [2019-12-19 04:06:02,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59000 to 59000. [2019-12-19 04:06:02,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59000 states. [2019-12-19 04:06:04,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59000 states to 59000 states and 240125 transitions. [2019-12-19 04:06:04,628 INFO L78 Accepts]: Start accepts. Automaton has 59000 states and 240125 transitions. Word has length 39 [2019-12-19 04:06:04,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:06:04,628 INFO L462 AbstractCegarLoop]: Abstraction has 59000 states and 240125 transitions. [2019-12-19 04:06:04,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:06:04,629 INFO L276 IsEmpty]: Start isEmpty. Operand 59000 states and 240125 transitions. [2019-12-19 04:06:04,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-19 04:06:04,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:06:04,643 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] [2019-12-19 04:06:04,644 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:06:04,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:06:04,644 INFO L82 PathProgramCache]: Analyzing trace with hash -256602995, now seen corresponding path program 1 times [2019-12-19 04:06:04,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:06:04,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454052984] [2019-12-19 04:06:04,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:06:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:06:04,773 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 04:06:04,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454052984] [2019-12-19 04:06:04,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:06:04,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:06:04,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455153842] [2019-12-19 04:06:04,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:06:04,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:06:04,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:06:04,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:06:04,777 INFO L87 Difference]: Start difference. First operand 59000 states and 240125 transitions. Second operand 5 states. [2019-12-19 04:06:05,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:06:05,926 INFO L93 Difference]: Finished difference Result 95594 states and 363716 transitions. [2019-12-19 04:06:05,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:06:05,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-19 04:06:05,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:06:07,151 INFO L225 Difference]: With dead ends: 95594 [2019-12-19 04:06:07,151 INFO L226 Difference]: Without dead ends: 95042 [2019-12-19 04:06:07,152 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 04:06:10,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95042 states. [2019-12-19 04:06:12,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95042 to 93164. [2019-12-19 04:06:12,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93164 states. [2019-12-19 04:06:13,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93164 states to 93164 states and 356302 transitions. [2019-12-19 04:06:13,065 INFO L78 Accepts]: Start accepts. Automaton has 93164 states and 356302 transitions. Word has length 47 [2019-12-19 04:06:13,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:06:13,066 INFO L462 AbstractCegarLoop]: Abstraction has 93164 states and 356302 transitions. [2019-12-19 04:06:13,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:06:13,067 INFO L276 IsEmpty]: Start isEmpty. Operand 93164 states and 356302 transitions. [2019-12-19 04:06:13,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-19 04:06:13,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:06:13,072 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] [2019-12-19 04:06:13,073 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:06:13,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:06:13,073 INFO L82 PathProgramCache]: Analyzing trace with hash -85893698, now seen corresponding path program 1 times [2019-12-19 04:06:13,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:06:13,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122136219] [2019-12-19 04:06:13,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:06:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:06:13,208 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 04:06:13,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122136219] [2019-12-19 04:06:13,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:06:13,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:06:13,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442462800] [2019-12-19 04:06:13,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:06:13,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:06:13,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:06:13,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:06:13,212 INFO L87 Difference]: Start difference. First operand 93164 states and 356302 transitions. Second operand 5 states. [2019-12-19 04:06:17,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:06:17,020 INFO L93 Difference]: Finished difference Result 118508 states and 442883 transitions. [2019-12-19 04:06:17,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:06:17,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-19 04:06:17,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:06:17,350 INFO L225 Difference]: With dead ends: 118508 [2019-12-19 04:06:17,350 INFO L226 Difference]: Without dead ends: 118060 [2019-12-19 04:06:17,350 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 04:06:18,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118060 states. [2019-12-19 04:06:21,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118060 to 104153. [2019-12-19 04:06:21,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104153 states. [2019-12-19 04:06:21,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104153 states to 104153 states and 394236 transitions. [2019-12-19 04:06:21,413 INFO L78 Accepts]: Start accepts. Automaton has 104153 states and 394236 transitions. Word has length 48 [2019-12-19 04:06:21,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:06:21,414 INFO L462 AbstractCegarLoop]: Abstraction has 104153 states and 394236 transitions. [2019-12-19 04:06:21,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:06:21,414 INFO L276 IsEmpty]: Start isEmpty. Operand 104153 states and 394236 transitions. [2019-12-19 04:06:21,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-19 04:06:21,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:06:21,425 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 04:06:21,425 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:06:21,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:06:21,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1345260124, now seen corresponding path program 1 times [2019-12-19 04:06:21,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:06:21,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967928187] [2019-12-19 04:06:21,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:06:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:06:21,474 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 04:06:21,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967928187] [2019-12-19 04:06:21,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:06:21,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 04:06:21,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392248301] [2019-12-19 04:06:21,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 04:06:21,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:06:21,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 04:06:21,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:06:21,477 INFO L87 Difference]: Start difference. First operand 104153 states and 394236 transitions. Second operand 3 states. [2019-12-19 04:06:26,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:06:26,008 INFO L93 Difference]: Finished difference Result 170911 states and 627058 transitions. [2019-12-19 04:06:26,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 04:06:26,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-19 04:06:26,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:06:26,452 INFO L225 Difference]: With dead ends: 170911 [2019-12-19 04:06:26,453 INFO L226 Difference]: Without dead ends: 170911 [2019-12-19 04:06:26,453 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 04:06:28,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170911 states. [2019-12-19 04:06:31,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170911 to 157189. [2019-12-19 04:06:31,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157189 states. [2019-12-19 04:06:32,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157189 states to 157189 states and 581290 transitions. [2019-12-19 04:06:32,014 INFO L78 Accepts]: Start accepts. Automaton has 157189 states and 581290 transitions. Word has length 50 [2019-12-19 04:06:32,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:06:32,014 INFO L462 AbstractCegarLoop]: Abstraction has 157189 states and 581290 transitions. [2019-12-19 04:06:32,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 04:06:32,014 INFO L276 IsEmpty]: Start isEmpty. Operand 157189 states and 581290 transitions. [2019-12-19 04:06:32,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 04:06:32,039 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:06:32,040 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] [2019-12-19 04:06:32,041 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:06:32,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:06:32,041 INFO L82 PathProgramCache]: Analyzing trace with hash 246072175, now seen corresponding path program 1 times [2019-12-19 04:06:32,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:06:32,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742989868] [2019-12-19 04:06:32,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:06:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:06:32,179 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 04:06:32,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742989868] [2019-12-19 04:06:32,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:06:32,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:06:32,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013535645] [2019-12-19 04:06:32,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:06:32,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:06:32,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:06:32,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:06:32,181 INFO L87 Difference]: Start difference. First operand 157189 states and 581290 transitions. Second operand 6 states. [2019-12-19 04:06:34,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:06:34,898 INFO L93 Difference]: Finished difference Result 212573 states and 766172 transitions. [2019-12-19 04:06:34,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 04:06:34,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-19 04:06:34,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:06:41,447 INFO L225 Difference]: With dead ends: 212573 [2019-12-19 04:06:41,447 INFO L226 Difference]: Without dead ends: 212053 [2019-12-19 04:06:41,448 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 04:06:43,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212053 states. [2019-12-19 04:06:46,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212053 to 157971. [2019-12-19 04:06:46,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157971 states. [2019-12-19 04:06:46,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157971 states to 157971 states and 584227 transitions. [2019-12-19 04:06:46,667 INFO L78 Accepts]: Start accepts. Automaton has 157971 states and 584227 transitions. Word has length 54 [2019-12-19 04:06:46,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:06:46,667 INFO L462 AbstractCegarLoop]: Abstraction has 157971 states and 584227 transitions. [2019-12-19 04:06:46,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:06:46,667 INFO L276 IsEmpty]: Start isEmpty. Operand 157971 states and 584227 transitions. [2019-12-19 04:06:46,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 04:06:46,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:06:46,687 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] [2019-12-19 04:06:46,687 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:06:46,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:06:46,687 INFO L82 PathProgramCache]: Analyzing trace with hash 104351519, now seen corresponding path program 1 times [2019-12-19 04:06:46,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:06:46,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140732332] [2019-12-19 04:06:46,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:06:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:06:46,821 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 04:06:46,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140732332] [2019-12-19 04:06:46,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:06:46,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:06:46,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262603318] [2019-12-19 04:06:46,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:06:46,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:06:46,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:06:46,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:06:46,827 INFO L87 Difference]: Start difference. First operand 157971 states and 584227 transitions. Second operand 7 states. [2019-12-19 04:06:53,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:06:53,351 INFO L93 Difference]: Finished difference Result 264420 states and 941443 transitions. [2019-12-19 04:06:53,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 04:06:53,351 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-19 04:06:53,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:06:53,998 INFO L225 Difference]: With dead ends: 264420 [2019-12-19 04:06:53,998 INFO L226 Difference]: Without dead ends: 264420 [2019-12-19 04:06:53,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 04:06:56,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264420 states. [2019-12-19 04:07:00,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264420 to 196980. [2019-12-19 04:07:00,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196980 states. [2019-12-19 04:07:08,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196980 states to 196980 states and 717858 transitions. [2019-12-19 04:07:08,444 INFO L78 Accepts]: Start accepts. Automaton has 196980 states and 717858 transitions. Word has length 54 [2019-12-19 04:07:08,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:08,444 INFO L462 AbstractCegarLoop]: Abstraction has 196980 states and 717858 transitions. [2019-12-19 04:07:08,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:07:08,444 INFO L276 IsEmpty]: Start isEmpty. Operand 196980 states and 717858 transitions. [2019-12-19 04:07:08,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 04:07:08,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:08,473 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] [2019-12-19 04:07:08,473 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:08,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:08,474 INFO L82 PathProgramCache]: Analyzing trace with hash 991855200, now seen corresponding path program 1 times [2019-12-19 04:07:08,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:08,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690484828] [2019-12-19 04:07:08,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:08,543 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 04:07:08,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690484828] [2019-12-19 04:07:08,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:08,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:07:08,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143637950] [2019-12-19 04:07:08,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:07:08,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:08,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:07:08,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:07:08,546 INFO L87 Difference]: Start difference. First operand 196980 states and 717858 transitions. Second operand 4 states. [2019-12-19 04:07:08,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:08,736 INFO L93 Difference]: Finished difference Result 30610 states and 95534 transitions. [2019-12-19 04:07:08,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:07:08,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-19 04:07:08,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:08,801 INFO L225 Difference]: With dead ends: 30610 [2019-12-19 04:07:08,802 INFO L226 Difference]: Without dead ends: 24312 [2019-12-19 04:07:08,802 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 04:07:08,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24312 states. [2019-12-19 04:07:09,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24312 to 24065. [2019-12-19 04:07:09,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24065 states. [2019-12-19 04:07:09,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24065 states to 24065 states and 73043 transitions. [2019-12-19 04:07:09,273 INFO L78 Accepts]: Start accepts. Automaton has 24065 states and 73043 transitions. Word has length 54 [2019-12-19 04:07:09,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:09,273 INFO L462 AbstractCegarLoop]: Abstraction has 24065 states and 73043 transitions. [2019-12-19 04:07:09,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:07:09,273 INFO L276 IsEmpty]: Start isEmpty. Operand 24065 states and 73043 transitions. [2019-12-19 04:07:09,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-19 04:07:09,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:09,281 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] [2019-12-19 04:07:09,282 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:09,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:09,282 INFO L82 PathProgramCache]: Analyzing trace with hash -274013666, now seen corresponding path program 1 times [2019-12-19 04:07:09,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:09,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241585878] [2019-12-19 04:07:09,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:09,363 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 04:07:09,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241585878] [2019-12-19 04:07:09,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:09,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:07:09,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502292216] [2019-12-19 04:07:09,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:07:09,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:09,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:07:09,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:07:09,366 INFO L87 Difference]: Start difference. First operand 24065 states and 73043 transitions. Second operand 4 states. [2019-12-19 04:07:09,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:09,652 INFO L93 Difference]: Finished difference Result 30645 states and 93922 transitions. [2019-12-19 04:07:09,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:07:09,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-19 04:07:09,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:09,700 INFO L225 Difference]: With dead ends: 30645 [2019-12-19 04:07:09,700 INFO L226 Difference]: Without dead ends: 30645 [2019-12-19 04:07:09,701 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 04:07:09,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30645 states. [2019-12-19 04:07:10,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30645 to 27294. [2019-12-19 04:07:10,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27294 states. [2019-12-19 04:07:11,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27294 states to 27294 states and 83105 transitions. [2019-12-19 04:07:11,245 INFO L78 Accepts]: Start accepts. Automaton has 27294 states and 83105 transitions. Word has length 64 [2019-12-19 04:07:11,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:11,245 INFO L462 AbstractCegarLoop]: Abstraction has 27294 states and 83105 transitions. [2019-12-19 04:07:11,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:07:11,245 INFO L276 IsEmpty]: Start isEmpty. Operand 27294 states and 83105 transitions. [2019-12-19 04:07:11,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-19 04:07:11,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:11,253 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] [2019-12-19 04:07:11,253 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:11,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:11,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1468796669, now seen corresponding path program 1 times [2019-12-19 04:07:11,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:11,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338303049] [2019-12-19 04:07:11,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:11,357 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 04:07:11,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338303049] [2019-12-19 04:07:11,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:11,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:07:11,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734165885] [2019-12-19 04:07:11,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:07:11,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:11,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:07:11,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:07:11,361 INFO L87 Difference]: Start difference. First operand 27294 states and 83105 transitions. Second operand 6 states. [2019-12-19 04:07:12,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:12,217 INFO L93 Difference]: Finished difference Result 37354 states and 111263 transitions. [2019-12-19 04:07:12,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-19 04:07:12,218 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-19 04:07:12,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:12,281 INFO L225 Difference]: With dead ends: 37354 [2019-12-19 04:07:12,281 INFO L226 Difference]: Without dead ends: 37306 [2019-12-19 04:07:12,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-12-19 04:07:12,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37306 states. [2019-12-19 04:07:12,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37306 to 31311. [2019-12-19 04:07:12,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31311 states. [2019-12-19 04:07:12,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31311 states to 31311 states and 94045 transitions. [2019-12-19 04:07:12,749 INFO L78 Accepts]: Start accepts. Automaton has 31311 states and 94045 transitions. Word has length 64 [2019-12-19 04:07:12,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:12,749 INFO L462 AbstractCegarLoop]: Abstraction has 31311 states and 94045 transitions. [2019-12-19 04:07:12,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:07:12,749 INFO L276 IsEmpty]: Start isEmpty. Operand 31311 states and 94045 transitions. [2019-12-19 04:07:12,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 04:07:12,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:12,763 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] [2019-12-19 04:07:12,764 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:12,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:12,764 INFO L82 PathProgramCache]: Analyzing trace with hash -466486930, now seen corresponding path program 1 times [2019-12-19 04:07:12,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:12,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523407123] [2019-12-19 04:07:12,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:12,802 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 04:07:12,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523407123] [2019-12-19 04:07:12,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:12,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 04:07:12,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661746432] [2019-12-19 04:07:12,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 04:07:12,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:12,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 04:07:12,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:07:12,805 INFO L87 Difference]: Start difference. First operand 31311 states and 94045 transitions. Second operand 3 states. [2019-12-19 04:07:12,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:12,977 INFO L93 Difference]: Finished difference Result 35437 states and 104776 transitions. [2019-12-19 04:07:12,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 04:07:12,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-19 04:07:12,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:13,033 INFO L225 Difference]: With dead ends: 35437 [2019-12-19 04:07:13,033 INFO L226 Difference]: Without dead ends: 35437 [2019-12-19 04:07:13,034 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 04:07:13,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35437 states. [2019-12-19 04:07:13,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35437 to 30985. [2019-12-19 04:07:13,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30985 states. [2019-12-19 04:07:14,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30985 states to 30985 states and 90960 transitions. [2019-12-19 04:07:14,166 INFO L78 Accepts]: Start accepts. Automaton has 30985 states and 90960 transitions. Word has length 70 [2019-12-19 04:07:14,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:14,166 INFO L462 AbstractCegarLoop]: Abstraction has 30985 states and 90960 transitions. [2019-12-19 04:07:14,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 04:07:14,167 INFO L276 IsEmpty]: Start isEmpty. Operand 30985 states and 90960 transitions. [2019-12-19 04:07:14,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 04:07:14,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:14,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] [2019-12-19 04:07:14,182 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:14,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:14,183 INFO L82 PathProgramCache]: Analyzing trace with hash 334384880, now seen corresponding path program 1 times [2019-12-19 04:07:14,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:14,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352732664] [2019-12-19 04:07:14,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:14,297 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 04:07:14,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352732664] [2019-12-19 04:07:14,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:14,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 04:07:14,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642559037] [2019-12-19 04:07:14,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 04:07:14,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:14,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 04:07:14,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:07:14,299 INFO L87 Difference]: Start difference. First operand 30985 states and 90960 transitions. Second operand 8 states. [2019-12-19 04:07:15,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:15,833 INFO L93 Difference]: Finished difference Result 40973 states and 119239 transitions. [2019-12-19 04:07:15,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 04:07:15,834 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2019-12-19 04:07:15,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:15,894 INFO L225 Difference]: With dead ends: 40973 [2019-12-19 04:07:15,894 INFO L226 Difference]: Without dead ends: 40973 [2019-12-19 04:07:15,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-19 04:07:15,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40973 states. [2019-12-19 04:07:16,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40973 to 34967. [2019-12-19 04:07:16,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34967 states. [2019-12-19 04:07:16,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34967 states to 34967 states and 102897 transitions. [2019-12-19 04:07:16,402 INFO L78 Accepts]: Start accepts. Automaton has 34967 states and 102897 transitions. Word has length 71 [2019-12-19 04:07:16,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:16,402 INFO L462 AbstractCegarLoop]: Abstraction has 34967 states and 102897 transitions. [2019-12-19 04:07:16,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 04:07:16,402 INFO L276 IsEmpty]: Start isEmpty. Operand 34967 states and 102897 transitions. [2019-12-19 04:07:16,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 04:07:16,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:16,416 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] [2019-12-19 04:07:16,416 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:16,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:16,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1221888561, now seen corresponding path program 1 times [2019-12-19 04:07:16,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:16,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462454295] [2019-12-19 04:07:16,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:16,502 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 04:07:16,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462454295] [2019-12-19 04:07:16,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:16,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:07:16,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414685486] [2019-12-19 04:07:16,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:07:16,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:16,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:07:16,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:07:16,504 INFO L87 Difference]: Start difference. First operand 34967 states and 102897 transitions. Second operand 5 states. [2019-12-19 04:07:16,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:16,578 INFO L93 Difference]: Finished difference Result 11717 states and 29266 transitions. [2019-12-19 04:07:16,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 04:07:16,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-19 04:07:16,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:16,594 INFO L225 Difference]: With dead ends: 11717 [2019-12-19 04:07:16,594 INFO L226 Difference]: Without dead ends: 10136 [2019-12-19 04:07:16,595 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 04:07:16,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10136 states. [2019-12-19 04:07:16,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10136 to 7516. [2019-12-19 04:07:16,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7516 states. [2019-12-19 04:07:16,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7516 states to 7516 states and 18693 transitions. [2019-12-19 04:07:16,704 INFO L78 Accepts]: Start accepts. Automaton has 7516 states and 18693 transitions. Word has length 71 [2019-12-19 04:07:16,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:16,705 INFO L462 AbstractCegarLoop]: Abstraction has 7516 states and 18693 transitions. [2019-12-19 04:07:16,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:07:16,705 INFO L276 IsEmpty]: Start isEmpty. Operand 7516 states and 18693 transitions. [2019-12-19 04:07:16,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 04:07:16,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:16,712 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] [2019-12-19 04:07:16,712 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:16,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:16,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1322286815, now seen corresponding path program 1 times [2019-12-19 04:07:16,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:16,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161722205] [2019-12-19 04:07:16,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:16,787 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 04:07:16,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161722205] [2019-12-19 04:07:16,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:16,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:07:16,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663663680] [2019-12-19 04:07:16,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:07:16,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:16,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:07:16,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:07:16,789 INFO L87 Difference]: Start difference. First operand 7516 states and 18693 transitions. Second operand 4 states. [2019-12-19 04:07:17,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:17,075 INFO L93 Difference]: Finished difference Result 8668 states and 21186 transitions. [2019-12-19 04:07:17,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 04:07:17,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-19 04:07:17,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:17,092 INFO L225 Difference]: With dead ends: 8668 [2019-12-19 04:07:17,092 INFO L226 Difference]: Without dead ends: 8668 [2019-12-19 04:07:17,093 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 04:07:17,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8668 states. [2019-12-19 04:07:17,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8668 to 8269. [2019-12-19 04:07:17,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8269 states. [2019-12-19 04:07:17,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8269 states to 8269 states and 20327 transitions. [2019-12-19 04:07:17,676 INFO L78 Accepts]: Start accepts. Automaton has 8269 states and 20327 transitions. Word has length 99 [2019-12-19 04:07:17,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:17,676 INFO L462 AbstractCegarLoop]: Abstraction has 8269 states and 20327 transitions. [2019-12-19 04:07:17,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:07:17,677 INFO L276 IsEmpty]: Start isEmpty. Operand 8269 states and 20327 transitions. [2019-12-19 04:07:17,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 04:07:17,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:17,693 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] [2019-12-19 04:07:17,694 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:17,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:17,694 INFO L82 PathProgramCache]: Analyzing trace with hash -754922528, now seen corresponding path program 1 times [2019-12-19 04:07:17,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:17,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211929528] [2019-12-19 04:07:17,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:17,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:07:17,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211929528] [2019-12-19 04:07:17,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:17,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 04:07:17,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894814539] [2019-12-19 04:07:17,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 04:07:17,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:17,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 04:07:17,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:07:17,775 INFO L87 Difference]: Start difference. First operand 8269 states and 20327 transitions. Second operand 3 states. [2019-12-19 04:07:18,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:18,026 INFO L93 Difference]: Finished difference Result 11444 states and 27681 transitions. [2019-12-19 04:07:18,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 04:07:18,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-12-19 04:07:18,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:18,042 INFO L225 Difference]: With dead ends: 11444 [2019-12-19 04:07:18,043 INFO L226 Difference]: Without dead ends: 11444 [2019-12-19 04:07:18,043 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 04:07:18,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11444 states. [2019-12-19 04:07:18,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11444 to 10312. [2019-12-19 04:07:18,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10312 states. [2019-12-19 04:07:18,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10312 states to 10312 states and 25151 transitions. [2019-12-19 04:07:18,177 INFO L78 Accepts]: Start accepts. Automaton has 10312 states and 25151 transitions. Word has length 99 [2019-12-19 04:07:18,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:18,177 INFO L462 AbstractCegarLoop]: Abstraction has 10312 states and 25151 transitions. [2019-12-19 04:07:18,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 04:07:18,177 INFO L276 IsEmpty]: Start isEmpty. Operand 10312 states and 25151 transitions. [2019-12-19 04:07:18,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 04:07:18,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:18,187 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] [2019-12-19 04:07:18,188 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:18,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:18,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1377648498, now seen corresponding path program 2 times [2019-12-19 04:07:18,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:18,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219776664] [2019-12-19 04:07:18,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:18,265 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 04:07:18,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219776664] [2019-12-19 04:07:18,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:18,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:07:18,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211020598] [2019-12-19 04:07:18,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:07:18,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:18,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:07:18,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:07:18,268 INFO L87 Difference]: Start difference. First operand 10312 states and 25151 transitions. Second operand 5 states. [2019-12-19 04:07:18,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:18,743 INFO L93 Difference]: Finished difference Result 12118 states and 28952 transitions. [2019-12-19 04:07:18,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:07:18,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-12-19 04:07:18,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:18,765 INFO L225 Difference]: With dead ends: 12118 [2019-12-19 04:07:18,766 INFO L226 Difference]: Without dead ends: 12118 [2019-12-19 04:07:18,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 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 04:07:18,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12118 states. [2019-12-19 04:07:18,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12118 to 10898. [2019-12-19 04:07:18,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10898 states. [2019-12-19 04:07:18,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10898 states to 10898 states and 26367 transitions. [2019-12-19 04:07:18,966 INFO L78 Accepts]: Start accepts. Automaton has 10898 states and 26367 transitions. Word has length 99 [2019-12-19 04:07:18,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:18,967 INFO L462 AbstractCegarLoop]: Abstraction has 10898 states and 26367 transitions. [2019-12-19 04:07:18,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:07:18,967 INFO L276 IsEmpty]: Start isEmpty. Operand 10898 states and 26367 transitions. [2019-12-19 04:07:18,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 04:07:18,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:18,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] [2019-12-19 04:07:18,981 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:18,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:18,981 INFO L82 PathProgramCache]: Analyzing trace with hash -2088609024, now seen corresponding path program 3 times [2019-12-19 04:07:18,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:18,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248600470] [2019-12-19 04:07:18,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:18,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:19,055 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 04:07:19,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248600470] [2019-12-19 04:07:19,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:19,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:07:19,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138580521] [2019-12-19 04:07:19,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:07:19,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:19,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:07:19,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:07:19,057 INFO L87 Difference]: Start difference. First operand 10898 states and 26367 transitions. Second operand 6 states. [2019-12-19 04:07:19,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:19,688 INFO L93 Difference]: Finished difference Result 13301 states and 31605 transitions. [2019-12-19 04:07:19,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:07:19,688 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-12-19 04:07:19,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:19,712 INFO L225 Difference]: With dead ends: 13301 [2019-12-19 04:07:19,712 INFO L226 Difference]: Without dead ends: 13301 [2019-12-19 04:07:19,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 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 04:07:19,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13301 states. [2019-12-19 04:07:19,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13301 to 10682. [2019-12-19 04:07:19,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10682 states. [2019-12-19 04:07:19,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10682 states to 10682 states and 25401 transitions. [2019-12-19 04:07:19,965 INFO L78 Accepts]: Start accepts. Automaton has 10682 states and 25401 transitions. Word has length 99 [2019-12-19 04:07:19,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:19,965 INFO L462 AbstractCegarLoop]: Abstraction has 10682 states and 25401 transitions. [2019-12-19 04:07:19,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:07:19,966 INFO L276 IsEmpty]: Start isEmpty. Operand 10682 states and 25401 transitions. [2019-12-19 04:07:19,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-19 04:07:19,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:19,986 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] [2019-12-19 04:07:19,986 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:19,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:19,987 INFO L82 PathProgramCache]: Analyzing trace with hash -689041407, now seen corresponding path program 1 times [2019-12-19 04:07:19,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:19,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911199344] [2019-12-19 04:07:19,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:20,093 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 04:07:20,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911199344] [2019-12-19 04:07:20,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:20,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:07:20,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341784572] [2019-12-19 04:07:20,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:07:20,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:20,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:07:20,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:07:20,096 INFO L87 Difference]: Start difference. First operand 10682 states and 25401 transitions. Second operand 5 states. [2019-12-19 04:07:20,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:20,315 INFO L93 Difference]: Finished difference Result 12248 states and 29269 transitions. [2019-12-19 04:07:20,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 04:07:20,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-12-19 04:07:20,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:20,337 INFO L225 Difference]: With dead ends: 12248 [2019-12-19 04:07:20,337 INFO L226 Difference]: Without dead ends: 12248 [2019-12-19 04:07:20,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 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 04:07:20,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12248 states. [2019-12-19 04:07:20,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12248 to 10895. [2019-12-19 04:07:20,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10895 states. [2019-12-19 04:07:20,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10895 states to 10895 states and 25926 transitions. [2019-12-19 04:07:20,521 INFO L78 Accepts]: Start accepts. Automaton has 10895 states and 25926 transitions. Word has length 101 [2019-12-19 04:07:20,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:20,521 INFO L462 AbstractCegarLoop]: Abstraction has 10895 states and 25926 transitions. [2019-12-19 04:07:20,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:07:20,522 INFO L276 IsEmpty]: Start isEmpty. Operand 10895 states and 25926 transitions. [2019-12-19 04:07:20,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-19 04:07:20,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:20,537 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] [2019-12-19 04:07:20,537 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:20,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:20,538 INFO L82 PathProgramCache]: Analyzing trace with hash -943777952, now seen corresponding path program 1 times [2019-12-19 04:07:20,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:20,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305802275] [2019-12-19 04:07:20,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:20,640 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 04:07:20,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305802275] [2019-12-19 04:07:20,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:20,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:07:20,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537109755] [2019-12-19 04:07:20,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:07:20,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:20,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:07:20,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:07:20,647 INFO L87 Difference]: Start difference. First operand 10895 states and 25926 transitions. Second operand 6 states. [2019-12-19 04:07:21,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:21,147 INFO L93 Difference]: Finished difference Result 12159 states and 28599 transitions. [2019-12-19 04:07:21,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 04:07:21,148 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-12-19 04:07:21,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:21,164 INFO L225 Difference]: With dead ends: 12159 [2019-12-19 04:07:21,165 INFO L226 Difference]: Without dead ends: 12159 [2019-12-19 04:07:21,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-19 04:07:21,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12159 states. [2019-12-19 04:07:21,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12159 to 11047. [2019-12-19 04:07:21,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11047 states. [2019-12-19 04:07:21,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11047 states to 11047 states and 26252 transitions. [2019-12-19 04:07:21,703 INFO L78 Accepts]: Start accepts. Automaton has 11047 states and 26252 transitions. Word has length 101 [2019-12-19 04:07:21,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:21,704 INFO L462 AbstractCegarLoop]: Abstraction has 11047 states and 26252 transitions. [2019-12-19 04:07:21,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:07:21,704 INFO L276 IsEmpty]: Start isEmpty. Operand 11047 states and 26252 transitions. [2019-12-19 04:07:21,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-19 04:07:21,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:21,718 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] [2019-12-19 04:07:21,718 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:21,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:21,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1119204126, now seen corresponding path program 1 times [2019-12-19 04:07:21,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:21,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420314755] [2019-12-19 04:07:21,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:21,800 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 04:07:21,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420314755] [2019-12-19 04:07:21,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:21,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:07:21,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492695576] [2019-12-19 04:07:21,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:07:21,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:21,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:07:21,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:07:21,802 INFO L87 Difference]: Start difference. First operand 11047 states and 26252 transitions. Second operand 7 states. [2019-12-19 04:07:22,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:22,514 INFO L93 Difference]: Finished difference Result 14289 states and 33832 transitions. [2019-12-19 04:07:22,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 04:07:22,515 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2019-12-19 04:07:22,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:22,532 INFO L225 Difference]: With dead ends: 14289 [2019-12-19 04:07:22,532 INFO L226 Difference]: Without dead ends: 14289 [2019-12-19 04:07:22,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-19 04:07:22,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14289 states. [2019-12-19 04:07:22,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14289 to 11610. [2019-12-19 04:07:22,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11610 states. [2019-12-19 04:07:22,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11610 states to 11610 states and 27686 transitions. [2019-12-19 04:07:22,679 INFO L78 Accepts]: Start accepts. Automaton has 11610 states and 27686 transitions. Word has length 101 [2019-12-19 04:07:22,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:22,679 INFO L462 AbstractCegarLoop]: Abstraction has 11610 states and 27686 transitions. [2019-12-19 04:07:22,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:07:22,679 INFO L276 IsEmpty]: Start isEmpty. Operand 11610 states and 27686 transitions. [2019-12-19 04:07:22,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-19 04:07:22,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:22,690 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:07:22,690 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:22,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:22,691 INFO L82 PathProgramCache]: Analyzing trace with hash 2006707807, now seen corresponding path program 1 times [2019-12-19 04:07:22,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:22,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009420734] [2019-12-19 04:07:22,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:22,825 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 04:07:22,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009420734] [2019-12-19 04:07:22,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:22,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:07:22,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857046513] [2019-12-19 04:07:22,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:07:22,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:22,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:07:22,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:07:22,828 INFO L87 Difference]: Start difference. First operand 11610 states and 27686 transitions. Second operand 7 states. [2019-12-19 04:07:23,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:23,017 INFO L93 Difference]: Finished difference Result 13924 states and 33201 transitions. [2019-12-19 04:07:23,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:07:23,017 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2019-12-19 04:07:23,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:23,038 INFO L225 Difference]: With dead ends: 13924 [2019-12-19 04:07:23,038 INFO L226 Difference]: Without dead ends: 13924 [2019-12-19 04:07:23,038 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 04:07:23,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13924 states. [2019-12-19 04:07:23,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13924 to 12431. [2019-12-19 04:07:23,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12431 states. [2019-12-19 04:07:23,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12431 states to 12431 states and 29715 transitions. [2019-12-19 04:07:23,317 INFO L78 Accepts]: Start accepts. Automaton has 12431 states and 29715 transitions. Word has length 101 [2019-12-19 04:07:23,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:23,317 INFO L462 AbstractCegarLoop]: Abstraction has 12431 states and 29715 transitions. [2019-12-19 04:07:23,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:07:23,318 INFO L276 IsEmpty]: Start isEmpty. Operand 12431 states and 29715 transitions. [2019-12-19 04:07:23,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-19 04:07:23,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:23,337 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:07:23,338 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:23,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:23,338 INFO L82 PathProgramCache]: Analyzing trace with hash 762874655, now seen corresponding path program 1 times [2019-12-19 04:07:23,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:23,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548928254] [2019-12-19 04:07:23,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:23,522 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 04:07:23,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548928254] [2019-12-19 04:07:23,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:23,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:07:23,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114652140] [2019-12-19 04:07:23,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:07:23,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:23,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:07:23,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:07:23,525 INFO L87 Difference]: Start difference. First operand 12431 states and 29715 transitions. Second operand 6 states. [2019-12-19 04:07:23,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:23,773 INFO L93 Difference]: Finished difference Result 12350 states and 29382 transitions. [2019-12-19 04:07:23,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:07:23,774 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-12-19 04:07:23,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:23,792 INFO L225 Difference]: With dead ends: 12350 [2019-12-19 04:07:23,792 INFO L226 Difference]: Without dead ends: 12350 [2019-12-19 04:07:23,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:07:23,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12350 states. [2019-12-19 04:07:23,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12350 to 10951. [2019-12-19 04:07:23,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10951 states. [2019-12-19 04:07:23,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10951 states to 10951 states and 26225 transitions. [2019-12-19 04:07:23,997 INFO L78 Accepts]: Start accepts. Automaton has 10951 states and 26225 transitions. Word has length 101 [2019-12-19 04:07:23,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:23,998 INFO L462 AbstractCegarLoop]: Abstraction has 10951 states and 26225 transitions. [2019-12-19 04:07:23,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:07:23,998 INFO L276 IsEmpty]: Start isEmpty. Operand 10951 states and 26225 transitions. [2019-12-19 04:07:24,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-19 04:07:24,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:24,010 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 04:07:24,010 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:24,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:24,011 INFO L82 PathProgramCache]: Analyzing trace with hash 409106765, now seen corresponding path program 1 times [2019-12-19 04:07:24,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:24,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015206039] [2019-12-19 04:07:24,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:24,109 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 04:07:24,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015206039] [2019-12-19 04:07:24,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:24,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 04:07:24,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102674153] [2019-12-19 04:07:24,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 04:07:24,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:24,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 04:07:24,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:07:24,114 INFO L87 Difference]: Start difference. First operand 10951 states and 26225 transitions. Second operand 8 states. [2019-12-19 04:07:25,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:25,867 INFO L93 Difference]: Finished difference Result 18824 states and 44079 transitions. [2019-12-19 04:07:25,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-19 04:07:25,868 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 103 [2019-12-19 04:07:25,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:25,890 INFO L225 Difference]: With dead ends: 18824 [2019-12-19 04:07:25,890 INFO L226 Difference]: Without dead ends: 18744 [2019-12-19 04:07:25,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2019-12-19 04:07:25,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18744 states. [2019-12-19 04:07:26,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18744 to 14378. [2019-12-19 04:07:26,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14378 states. [2019-12-19 04:07:26,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14378 states to 14378 states and 34317 transitions. [2019-12-19 04:07:26,488 INFO L78 Accepts]: Start accepts. Automaton has 14378 states and 34317 transitions. Word has length 103 [2019-12-19 04:07:26,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:26,488 INFO L462 AbstractCegarLoop]: Abstraction has 14378 states and 34317 transitions. [2019-12-19 04:07:26,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 04:07:26,488 INFO L276 IsEmpty]: Start isEmpty. Operand 14378 states and 34317 transitions. [2019-12-19 04:07:26,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-19 04:07:26,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:26,501 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:07:26,501 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:26,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:26,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1668102578, now seen corresponding path program 1 times [2019-12-19 04:07:26,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:26,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145136572] [2019-12-19 04:07:26,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:26,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:07:26,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145136572] [2019-12-19 04:07:26,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:26,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:07:26,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047894319] [2019-12-19 04:07:26,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:07:26,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:26,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:07:26,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:07:26,642 INFO L87 Difference]: Start difference. First operand 14378 states and 34317 transitions. Second operand 7 states. [2019-12-19 04:07:27,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:27,303 INFO L93 Difference]: Finished difference Result 18290 states and 42267 transitions. [2019-12-19 04:07:27,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 04:07:27,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2019-12-19 04:07:27,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:27,325 INFO L225 Difference]: With dead ends: 18290 [2019-12-19 04:07:27,325 INFO L226 Difference]: Without dead ends: 18290 [2019-12-19 04:07:27,325 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 04:07:27,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18290 states. [2019-12-19 04:07:27,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18290 to 15910. [2019-12-19 04:07:27,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15910 states. [2019-12-19 04:07:27,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15910 states to 15910 states and 37317 transitions. [2019-12-19 04:07:27,523 INFO L78 Accepts]: Start accepts. Automaton has 15910 states and 37317 transitions. Word has length 103 [2019-12-19 04:07:27,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:27,523 INFO L462 AbstractCegarLoop]: Abstraction has 15910 states and 37317 transitions. [2019-12-19 04:07:27,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:07:27,523 INFO L276 IsEmpty]: Start isEmpty. Operand 15910 states and 37317 transitions. [2019-12-19 04:07:27,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-19 04:07:27,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:27,539 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 04:07:27,539 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:27,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:27,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1456751665, now seen corresponding path program 1 times [2019-12-19 04:07:27,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:27,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419710127] [2019-12-19 04:07:27,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:27,661 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 04:07:27,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419710127] [2019-12-19 04:07:27,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:27,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:07:27,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164019985] [2019-12-19 04:07:27,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:07:27,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:27,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:07:27,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:07:27,663 INFO L87 Difference]: Start difference. First operand 15910 states and 37317 transitions. Second operand 7 states. [2019-12-19 04:07:27,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:28,000 INFO L93 Difference]: Finished difference Result 16472 states and 38509 transitions. [2019-12-19 04:07:28,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 04:07:28,000 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2019-12-19 04:07:28,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:28,020 INFO L225 Difference]: With dead ends: 16472 [2019-12-19 04:07:28,020 INFO L226 Difference]: Without dead ends: 16472 [2019-12-19 04:07:28,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-19 04:07:28,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16472 states. [2019-12-19 04:07:28,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16472 to 16351. [2019-12-19 04:07:28,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16351 states. [2019-12-19 04:07:28,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16351 states to 16351 states and 38273 transitions. [2019-12-19 04:07:28,199 INFO L78 Accepts]: Start accepts. Automaton has 16351 states and 38273 transitions. Word has length 103 [2019-12-19 04:07:28,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:28,199 INFO L462 AbstractCegarLoop]: Abstraction has 16351 states and 38273 transitions. [2019-12-19 04:07:28,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:07:28,199 INFO L276 IsEmpty]: Start isEmpty. Operand 16351 states and 38273 transitions. [2019-12-19 04:07:28,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-19 04:07:28,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:28,214 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 04:07:28,214 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:28,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:28,215 INFO L82 PathProgramCache]: Analyzing trace with hash -569247984, now seen corresponding path program 1 times [2019-12-19 04:07:28,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:28,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686383755] [2019-12-19 04:07:28,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:28,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 04:07:28,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686383755] [2019-12-19 04:07:28,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:28,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 04:07:28,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811746508] [2019-12-19 04:07:28,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 04:07:28,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:28,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 04:07:28,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:07:28,265 INFO L87 Difference]: Start difference. First operand 16351 states and 38273 transitions. Second operand 3 states. [2019-12-19 04:07:28,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:28,345 INFO L93 Difference]: Finished difference Result 19583 states and 45726 transitions. [2019-12-19 04:07:28,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 04:07:28,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-12-19 04:07:28,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:28,374 INFO L225 Difference]: With dead ends: 19583 [2019-12-19 04:07:28,374 INFO L226 Difference]: Without dead ends: 19583 [2019-12-19 04:07:28,375 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 04:07:28,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19583 states. [2019-12-19 04:07:28,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19583 to 19507. [2019-12-19 04:07:28,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19507 states. [2019-12-19 04:07:28,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19507 states to 19507 states and 45563 transitions. [2019-12-19 04:07:28,787 INFO L78 Accepts]: Start accepts. Automaton has 19507 states and 45563 transitions. Word has length 103 [2019-12-19 04:07:28,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:28,788 INFO L462 AbstractCegarLoop]: Abstraction has 19507 states and 45563 transitions. [2019-12-19 04:07:28,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 04:07:28,788 INFO L276 IsEmpty]: Start isEmpty. Operand 19507 states and 45563 transitions. [2019-12-19 04:07:28,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-19 04:07:28,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:28,819 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 04:07:28,819 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:28,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:28,820 INFO L82 PathProgramCache]: Analyzing trace with hash -218448047, now seen corresponding path program 1 times [2019-12-19 04:07:28,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:28,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135082665] [2019-12-19 04:07:28,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:28,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:29,089 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 04:07:29,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135082665] [2019-12-19 04:07:29,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:29,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-19 04:07:29,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088432594] [2019-12-19 04:07:29,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-19 04:07:29,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:29,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-19 04:07:29,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-19 04:07:29,093 INFO L87 Difference]: Start difference. First operand 19507 states and 45563 transitions. Second operand 11 states. [2019-12-19 04:07:30,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:30,081 INFO L93 Difference]: Finished difference Result 26782 states and 61957 transitions. [2019-12-19 04:07:30,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-19 04:07:30,082 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 103 [2019-12-19 04:07:30,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:30,111 INFO L225 Difference]: With dead ends: 26782 [2019-12-19 04:07:30,112 INFO L226 Difference]: Without dead ends: 24726 [2019-12-19 04:07:30,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-19 04:07:30,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24726 states. [2019-12-19 04:07:30,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24726 to 22935. [2019-12-19 04:07:30,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22935 states. [2019-12-19 04:07:30,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22935 states to 22935 states and 53604 transitions. [2019-12-19 04:07:30,380 INFO L78 Accepts]: Start accepts. Automaton has 22935 states and 53604 transitions. Word has length 103 [2019-12-19 04:07:30,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:30,380 INFO L462 AbstractCegarLoop]: Abstraction has 22935 states and 53604 transitions. [2019-12-19 04:07:30,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-19 04:07:30,381 INFO L276 IsEmpty]: Start isEmpty. Operand 22935 states and 53604 transitions. [2019-12-19 04:07:30,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-19 04:07:30,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:30,404 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 04:07:30,404 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:30,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:30,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1205242523, now seen corresponding path program 1 times [2019-12-19 04:07:30,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:30,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739596785] [2019-12-19 04:07:30,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:30,527 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 04:07:30,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739596785] [2019-12-19 04:07:30,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:30,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 04:07:30,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276770795] [2019-12-19 04:07:30,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 04:07:30,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:30,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 04:07:30,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:07:30,528 INFO L87 Difference]: Start difference. First operand 22935 states and 53604 transitions. Second operand 8 states. [2019-12-19 04:07:30,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:30,709 INFO L93 Difference]: Finished difference Result 23440 states and 54722 transitions. [2019-12-19 04:07:30,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:07:30,709 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 103 [2019-12-19 04:07:30,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:30,716 INFO L225 Difference]: With dead ends: 23440 [2019-12-19 04:07:30,716 INFO L226 Difference]: Without dead ends: 3440 [2019-12-19 04:07:30,717 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 04:07:30,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3440 states. [2019-12-19 04:07:30,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3440 to 3438. [2019-12-19 04:07:30,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3438 states. [2019-12-19 04:07:30,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3438 states to 3438 states and 8134 transitions. [2019-12-19 04:07:30,778 INFO L78 Accepts]: Start accepts. Automaton has 3438 states and 8134 transitions. Word has length 103 [2019-12-19 04:07:30,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:30,778 INFO L462 AbstractCegarLoop]: Abstraction has 3438 states and 8134 transitions. [2019-12-19 04:07:30,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 04:07:30,778 INFO L276 IsEmpty]: Start isEmpty. Operand 3438 states and 8134 transitions. [2019-12-19 04:07:30,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-19 04:07:30,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:30,783 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 04:07:30,784 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:30,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:30,784 INFO L82 PathProgramCache]: Analyzing trace with hash 17628483, now seen corresponding path program 1 times [2019-12-19 04:07:30,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:30,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074417436] [2019-12-19 04:07:30,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:30,900 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 04:07:30,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074417436] [2019-12-19 04:07:30,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:30,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 04:07:30,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680155179] [2019-12-19 04:07:30,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 04:07:30,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:30,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 04:07:30,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:07:30,902 INFO L87 Difference]: Start difference. First operand 3438 states and 8134 transitions. Second operand 8 states. [2019-12-19 04:07:31,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:31,696 INFO L93 Difference]: Finished difference Result 4235 states and 9887 transitions. [2019-12-19 04:07:31,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 04:07:31,697 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 103 [2019-12-19 04:07:31,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:31,705 INFO L225 Difference]: With dead ends: 4235 [2019-12-19 04:07:31,705 INFO L226 Difference]: Without dead ends: 4199 [2019-12-19 04:07:31,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-19 04:07:31,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4199 states. [2019-12-19 04:07:31,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4199 to 3528. [2019-12-19 04:07:31,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3528 states. [2019-12-19 04:07:31,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3528 states to 3528 states and 8332 transitions. [2019-12-19 04:07:31,783 INFO L78 Accepts]: Start accepts. Automaton has 3528 states and 8332 transitions. Word has length 103 [2019-12-19 04:07:31,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:31,783 INFO L462 AbstractCegarLoop]: Abstraction has 3528 states and 8332 transitions. [2019-12-19 04:07:31,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 04:07:31,784 INFO L276 IsEmpty]: Start isEmpty. Operand 3528 states and 8332 transitions. [2019-12-19 04:07:31,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-19 04:07:31,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:31,788 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 04:07:31,788 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:31,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:31,789 INFO L82 PathProgramCache]: Analyzing trace with hash 368428420, now seen corresponding path program 2 times [2019-12-19 04:07:31,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:31,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956084912] [2019-12-19 04:07:31,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:31,959 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 04:07:31,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956084912] [2019-12-19 04:07:31,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:31,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-19 04:07:31,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556592747] [2019-12-19 04:07:31,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-19 04:07:31,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:31,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-19 04:07:31,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-19 04:07:31,961 INFO L87 Difference]: Start difference. First operand 3528 states and 8332 transitions. Second operand 11 states. [2019-12-19 04:07:32,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:32,474 INFO L93 Difference]: Finished difference Result 6508 states and 14933 transitions. [2019-12-19 04:07:32,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-19 04:07:32,475 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 103 [2019-12-19 04:07:32,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:32,480 INFO L225 Difference]: With dead ends: 6508 [2019-12-19 04:07:32,481 INFO L226 Difference]: Without dead ends: 4667 [2019-12-19 04:07:32,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2019-12-19 04:07:32,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4667 states. [2019-12-19 04:07:32,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4667 to 3566. [2019-12-19 04:07:32,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3566 states. [2019-12-19 04:07:32,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3566 states to 3566 states and 8355 transitions. [2019-12-19 04:07:32,521 INFO L78 Accepts]: Start accepts. Automaton has 3566 states and 8355 transitions. Word has length 103 [2019-12-19 04:07:32,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:32,522 INFO L462 AbstractCegarLoop]: Abstraction has 3566 states and 8355 transitions. [2019-12-19 04:07:32,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-19 04:07:32,522 INFO L276 IsEmpty]: Start isEmpty. Operand 3566 states and 8355 transitions. [2019-12-19 04:07:32,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-19 04:07:32,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:32,525 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 04:07:32,525 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:32,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:32,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1899206436, now seen corresponding path program 3 times [2019-12-19 04:07:32,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:32,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784707549] [2019-12-19 04:07:32,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 04:07:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 04:07:32,622 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 04:07:32,623 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 04:07:32,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 04:07:32 BasicIcfg [2019-12-19 04:07:32,895 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 04:07:32,900 INFO L168 Benchmark]: Toolchain (without parser) took 109589.73 ms. Allocated memory was 144.7 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 101.5 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-19 04:07:32,900 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 144.7 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-19 04:07:32,901 INFO L168 Benchmark]: CACSL2BoogieTranslator took 824.87 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 101.1 MB in the beginning and 155.6 MB in the end (delta: -54.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. [2019-12-19 04:07:32,901 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.60 ms. Allocated memory is still 201.9 MB. Free memory was 154.7 MB in the beginning and 151.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 04:07:32,902 INFO L168 Benchmark]: Boogie Preprocessor took 39.00 ms. Allocated memory is still 201.9 MB. Free memory was 151.8 MB in the beginning and 149.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-19 04:07:32,902 INFO L168 Benchmark]: RCFGBuilder took 1129.96 ms. Allocated memory is still 201.9 MB. Free memory was 149.8 MB in the beginning and 97.3 MB in the end (delta: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 7.1 GB. [2019-12-19 04:07:32,906 INFO L168 Benchmark]: TraceAbstraction took 107515.75 ms. Allocated memory was 201.9 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 96.4 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-12-19 04:07:32,908 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 144.7 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 824.87 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 101.1 MB in the beginning and 155.6 MB in the end (delta: -54.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.60 ms. Allocated memory is still 201.9 MB. Free memory was 154.7 MB in the beginning and 151.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 39.00 ms. Allocated memory is still 201.9 MB. Free memory was 151.8 MB in the beginning and 149.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1129.96 ms. Allocated memory is still 201.9 MB. Free memory was 149.8 MB in the beginning and 97.3 MB in the end (delta: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 107515.75 ms. Allocated memory was 201.9 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 96.4 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.7 GB. 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L702] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L703] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L705] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L707] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L708] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L709] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L710] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L711] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L712] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L713] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L714] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L715] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L716] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L717] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}] [L718] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L719] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L720] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L721] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L722] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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] [L723] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] 0 pthread_t t1761; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] FCALL, FORK 0 pthread_create(&t1761, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L811] 0 pthread_t t1762; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] FCALL, FORK 0 pthread_create(&t1762, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff1 = y$w_buff0 [L758] 2 y$w_buff0 = 1 [L759] 2 y$w_buff1_used = y$w_buff0_used [L760] 2 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L763] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L764] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L765] 2 y$r_buff0_thd2 = (_Bool)1 [L768] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 2 y$flush_delayed = weak$$choice2 [L771] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] 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) [L773] 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 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)) [L774] 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L774] 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)) [L775] 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L775] 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)) [L776] 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L776] 2 y$w_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)) [L777] 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] 2 y$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)) [L778] 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y$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)) [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] 2 y = y$flush_delayed ? y$mem_tmp : y [L781] 2 y$flush_delayed = (_Bool)0 [L784] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 x = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 y$flush_delayed = weak$$choice2 [L735] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L736] 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 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) [L737] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 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)) [L738] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 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)) [L739] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 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)) [L740] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 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)) [L787] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 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)) [L742] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 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)) [L743] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L744] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$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=1, y$w_buff1=0, y$w_buff1_used=0] [L787] 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) [L788] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, 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=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y = y$flush_delayed ? y$mem_tmp : y [L745] 1 y$flush_delayed = (_Bool)0 [L750] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L789] 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 [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L789] 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 [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L790] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L791] 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 [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L791] 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 [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L818] 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L818] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L818] 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L818] 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) [L819] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L820] 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 [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L822] 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$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 [L825] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 172 locations, 2 error locations. Result: UNSAFE, OverallTime: 107.0s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 43.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11060 SDtfs, 12584 SDslu, 28884 SDs, 0 SdLazy, 9749 SolverSat, 623 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 322 GetRequests, 84 SyntacticMatches, 11 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196980occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 50.5s AutomataMinimizationTime, 29 MinimizatonAttempts, 197614 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2514 NumberOfCodeBlocks, 2514 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2382 ConstructedInterpolants, 0 QuantifiedInterpolants, 542341 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...