/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi003_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:14:53,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:14:53,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:14:53,304 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:14:53,304 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:14:53,305 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:14:53,307 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:14:53,309 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:14:53,310 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:14:53,311 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:14:53,312 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:14:53,313 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:14:53,314 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:14:53,315 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:14:53,316 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:14:53,322 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:14:53,323 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:14:53,324 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:14:53,326 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:14:53,328 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:14:53,329 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:14:53,330 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:14:53,331 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:14:53,332 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:14:53,334 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:14:53,334 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:14:53,334 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:14:53,335 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:14:53,336 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:14:53,337 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:14:53,337 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:14:53,338 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:14:53,338 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:14:53,339 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:14:53,340 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:14:53,340 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:14:53,341 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:14:53,341 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:14:53,342 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:14:53,342 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:14:53,343 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:14:53,344 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:14:53,358 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:14:53,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:14:53,359 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:14:53,360 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:14:53,360 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:14:53,360 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:14:53,360 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:14:53,360 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:14:53,361 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:14:53,361 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:14:53,361 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:14:53,361 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:14:53,361 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:14:53,362 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:14:53,362 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:14:53,362 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:14:53,362 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:14:53,362 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:14:53,362 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:14:53,363 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:14:53,363 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:14:53,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:14:53,363 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:14:53,363 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:14:53,364 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:14:53,364 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:14:53,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:14:53,364 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:14:53,364 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:14:53,365 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:14:53,649 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:14:53,666 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:14:53,670 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:14:53,672 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:14:53,672 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:14:53,673 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_tso.opt.i [2019-12-26 23:14:53,742 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df22bb929/7cf5fcf90f0842f09dbf75660a9bc163/FLAG343d67e6e [2019-12-26 23:14:54,314 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:14:54,318 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_tso.opt.i [2019-12-26 23:14:54,348 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df22bb929/7cf5fcf90f0842f09dbf75660a9bc163/FLAG343d67e6e [2019-12-26 23:14:54,636 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df22bb929/7cf5fcf90f0842f09dbf75660a9bc163 [2019-12-26 23:14:54,646 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:14:54,648 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:14:54,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:14:54,649 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:14:54,653 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:14:54,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:14:54" (1/1) ... [2019-12-26 23:14:54,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@580b0a8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:54, skipping insertion in model container [2019-12-26 23:14:54,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:14:54" (1/1) ... [2019-12-26 23:14:54,666 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:14:54,731 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:14:55,312 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:14:55,330 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:14:55,426 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:14:55,502 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:14:55,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:55 WrapperNode [2019-12-26 23:14:55,503 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:14:55,504 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:14:55,504 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:14:55,504 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:14:55,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:55" (1/1) ... [2019-12-26 23:14:55,539 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:55" (1/1) ... [2019-12-26 23:14:55,596 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:14:55,597 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:14:55,597 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:14:55,597 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:14:55,608 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:55" (1/1) ... [2019-12-26 23:14:55,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:55" (1/1) ... [2019-12-26 23:14:55,613 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:55" (1/1) ... [2019-12-26 23:14:55,614 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:55" (1/1) ... [2019-12-26 23:14:55,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:55" (1/1) ... [2019-12-26 23:14:55,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:55" (1/1) ... [2019-12-26 23:14:55,639 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:55" (1/1) ... [2019-12-26 23:14:55,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:14:55,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:14:55,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:14:55,647 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:14:55,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:55" (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-26 23:14:55,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:14:55,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:14:55,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:14:55,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:14:55,732 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:14:55,733 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:14:55,733 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:14:55,733 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:14:55,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:14:55,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:14:55,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:14:55,736 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:14:56,838 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:14:56,839 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:14:56,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:14:56 BoogieIcfgContainer [2019-12-26 23:14:56,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:14:56,841 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:14:56,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:14:56,844 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:14:56,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:14:54" (1/3) ... [2019-12-26 23:14:56,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba65ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:14:56, skipping insertion in model container [2019-12-26 23:14:56,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:55" (2/3) ... [2019-12-26 23:14:56,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba65ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:14:56, skipping insertion in model container [2019-12-26 23:14:56,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:14:56" (3/3) ... [2019-12-26 23:14:56,848 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_tso.opt.i [2019-12-26 23:14:56,865 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:14:56,865 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:14:56,873 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:14:56,874 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:14:56,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,918 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,919 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,939 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,940 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,941 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,941 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,941 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:56,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,027 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,029 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,039 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,040 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,042 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:57,058 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 23:14:57,081 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:14:57,081 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:14:57,082 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:14:57,082 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:14:57,082 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:14:57,082 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:14:57,082 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:14:57,082 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:14:57,111 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 326 transitions [2019-12-26 23:14:57,114 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-26 23:14:57,299 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-26 23:14:57,300 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:14:57,351 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 796 event pairs. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-26 23:14:57,450 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-26 23:14:57,589 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-26 23:14:57,589 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:14:57,611 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 796 event pairs. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-26 23:14:57,661 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 49222 [2019-12-26 23:14:57,662 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:15:04,348 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-12-26 23:15:04,622 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-26 23:15:04,727 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-26 23:15:04,838 INFO L206 etLargeBlockEncoding]: Checked pairs total: 282427 [2019-12-26 23:15:04,838 INFO L214 etLargeBlockEncoding]: Total number of compositions: 142 [2019-12-26 23:15:04,841 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 155 places, 192 transitions [2019-12-26 23:15:13,665 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86906 states. [2019-12-26 23:15:13,666 INFO L276 IsEmpty]: Start isEmpty. Operand 86906 states. [2019-12-26 23:15:13,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 23:15:13,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:13,673 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 23:15:13,674 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:13,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:13,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1352240646, now seen corresponding path program 1 times [2019-12-26 23:15:13,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:13,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942901263] [2019-12-26 23:15:13,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:13,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:15:13,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942901263] [2019-12-26 23:15:13,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:13,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:15:13,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058210580] [2019-12-26 23:15:13,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:15:13,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:13,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:15:13,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:15:13,980 INFO L87 Difference]: Start difference. First operand 86906 states. Second operand 3 states. [2019-12-26 23:15:16,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:16,652 INFO L93 Difference]: Finished difference Result 86858 states and 312643 transitions. [2019-12-26 23:15:16,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:15:16,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 23:15:16,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:17,344 INFO L225 Difference]: With dead ends: 86858 [2019-12-26 23:15:17,344 INFO L226 Difference]: Without dead ends: 85058 [2019-12-26 23:15:17,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:15:20,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85058 states. [2019-12-26 23:15:22,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85058 to 85058. [2019-12-26 23:15:22,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85058 states. [2019-12-26 23:15:22,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85058 states to 85058 states and 306544 transitions. [2019-12-26 23:15:22,863 INFO L78 Accepts]: Start accepts. Automaton has 85058 states and 306544 transitions. Word has length 5 [2019-12-26 23:15:22,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:22,864 INFO L462 AbstractCegarLoop]: Abstraction has 85058 states and 306544 transitions. [2019-12-26 23:15:22,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:15:22,864 INFO L276 IsEmpty]: Start isEmpty. Operand 85058 states and 306544 transitions. [2019-12-26 23:15:22,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:15:22,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:22,867 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:15:22,867 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:22,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:22,868 INFO L82 PathProgramCache]: Analyzing trace with hash -2045261550, now seen corresponding path program 1 times [2019-12-26 23:15:22,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:22,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499045358] [2019-12-26 23:15:22,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:23,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:15:23,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499045358] [2019-12-26 23:15:23,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:23,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:15:23,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261816138] [2019-12-26 23:15:23,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:15:23,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:23,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:15:23,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:15:23,005 INFO L87 Difference]: Start difference. First operand 85058 states and 306544 transitions. Second operand 4 states. [2019-12-26 23:15:27,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:27,457 INFO L93 Difference]: Finished difference Result 127330 states and 444666 transitions. [2019-12-26 23:15:27,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:15:27,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:15:27,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:27,846 INFO L225 Difference]: With dead ends: 127330 [2019-12-26 23:15:27,846 INFO L226 Difference]: Without dead ends: 127330 [2019-12-26 23:15:27,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:15:31,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127330 states. [2019-12-26 23:15:35,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127330 to 126190. [2019-12-26 23:15:35,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126190 states. [2019-12-26 23:15:36,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126190 states to 126190 states and 441366 transitions. [2019-12-26 23:15:36,493 INFO L78 Accepts]: Start accepts. Automaton has 126190 states and 441366 transitions. Word has length 11 [2019-12-26 23:15:36,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:36,494 INFO L462 AbstractCegarLoop]: Abstraction has 126190 states and 441366 transitions. [2019-12-26 23:15:36,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:15:36,494 INFO L276 IsEmpty]: Start isEmpty. Operand 126190 states and 441366 transitions. [2019-12-26 23:15:36,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:15:36,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:36,497 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:15:36,497 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:36,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:36,498 INFO L82 PathProgramCache]: Analyzing trace with hash 216920818, now seen corresponding path program 1 times [2019-12-26 23:15:36,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:36,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280684908] [2019-12-26 23:15:36,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:36,545 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-26 23:15:36,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280684908] [2019-12-26 23:15:36,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:36,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:15:36,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377676214] [2019-12-26 23:15:36,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:15:36,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:36,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:15:36,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:15:36,548 INFO L87 Difference]: Start difference. First operand 126190 states and 441366 transitions. Second operand 3 states. [2019-12-26 23:15:36,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:36,580 INFO L93 Difference]: Finished difference Result 7755 states and 18817 transitions. [2019-12-26 23:15:36,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:15:36,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-26 23:15:36,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:36,601 INFO L225 Difference]: With dead ends: 7755 [2019-12-26 23:15:36,602 INFO L226 Difference]: Without dead ends: 7755 [2019-12-26 23:15:36,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-26 23:15:36,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7755 states. [2019-12-26 23:15:36,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7755 to 7715. [2019-12-26 23:15:36,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7715 states. [2019-12-26 23:15:36,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7715 states to 7715 states and 18737 transitions. [2019-12-26 23:15:36,736 INFO L78 Accepts]: Start accepts. Automaton has 7715 states and 18737 transitions. Word has length 11 [2019-12-26 23:15:36,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:36,737 INFO L462 AbstractCegarLoop]: Abstraction has 7715 states and 18737 transitions. [2019-12-26 23:15:36,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:15:36,737 INFO L276 IsEmpty]: Start isEmpty. Operand 7715 states and 18737 transitions. [2019-12-26 23:15:36,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 23:15:36,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:36,740 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] [2019-12-26 23:15:36,741 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:36,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:36,741 INFO L82 PathProgramCache]: Analyzing trace with hash -468341505, now seen corresponding path program 1 times [2019-12-26 23:15:36,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:36,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130313270] [2019-12-26 23:15:36,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:36,944 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-26 23:15:36,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130313270] [2019-12-26 23:15:36,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:36,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:15:36,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82161509] [2019-12-26 23:15:36,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:15:36,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:36,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:15:36,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:15:36,946 INFO L87 Difference]: Start difference. First operand 7715 states and 18737 transitions. Second operand 7 states. [2019-12-26 23:15:37,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:37,883 INFO L93 Difference]: Finished difference Result 9139 states and 21753 transitions. [2019-12-26 23:15:37,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:15:37,884 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-26 23:15:37,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:37,903 INFO L225 Difference]: With dead ends: 9139 [2019-12-26 23:15:37,904 INFO L226 Difference]: Without dead ends: 9139 [2019-12-26 23:15:37,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:15:37,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9139 states. [2019-12-26 23:15:38,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9139 to 8897. [2019-12-26 23:15:38,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8897 states. [2019-12-26 23:15:38,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8897 states to 8897 states and 21286 transitions. [2019-12-26 23:15:38,078 INFO L78 Accepts]: Start accepts. Automaton has 8897 states and 21286 transitions. Word has length 22 [2019-12-26 23:15:38,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:38,079 INFO L462 AbstractCegarLoop]: Abstraction has 8897 states and 21286 transitions. [2019-12-26 23:15:38,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:15:38,079 INFO L276 IsEmpty]: Start isEmpty. Operand 8897 states and 21286 transitions. [2019-12-26 23:15:38,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 23:15:38,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:38,084 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] [2019-12-26 23:15:38,084 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:38,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:38,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1753070628, now seen corresponding path program 1 times [2019-12-26 23:15:38,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:38,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166394466] [2019-12-26 23:15:38,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:38,164 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-26 23:15:38,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166394466] [2019-12-26 23:15:38,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:38,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:15:38,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364702958] [2019-12-26 23:15:38,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:15:38,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:38,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:15:38,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:15:38,165 INFO L87 Difference]: Start difference. First operand 8897 states and 21286 transitions. Second operand 4 states. [2019-12-26 23:15:38,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:38,210 INFO L93 Difference]: Finished difference Result 3410 states and 7630 transitions. [2019-12-26 23:15:38,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:15:38,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-26 23:15:38,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:38,218 INFO L225 Difference]: With dead ends: 3410 [2019-12-26 23:15:38,218 INFO L226 Difference]: Without dead ends: 3410 [2019-12-26 23:15:38,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:15:38,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3410 states. [2019-12-26 23:15:38,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3410 to 3334. [2019-12-26 23:15:38,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3334 states. [2019-12-26 23:15:38,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3334 states to 3334 states and 7489 transitions. [2019-12-26 23:15:38,272 INFO L78 Accepts]: Start accepts. Automaton has 3334 states and 7489 transitions. Word has length 34 [2019-12-26 23:15:38,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:38,272 INFO L462 AbstractCegarLoop]: Abstraction has 3334 states and 7489 transitions. [2019-12-26 23:15:38,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:15:38,273 INFO L276 IsEmpty]: Start isEmpty. Operand 3334 states and 7489 transitions. [2019-12-26 23:15:38,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-26 23:15:38,283 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:38,284 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] [2019-12-26 23:15:38,284 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:38,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:38,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1776556996, now seen corresponding path program 1 times [2019-12-26 23:15:38,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:38,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660402500] [2019-12-26 23:15:38,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:38,420 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-26 23:15:38,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660402500] [2019-12-26 23:15:38,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:38,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:15:38,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880049906] [2019-12-26 23:15:38,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:15:38,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:38,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:15:38,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:15:38,424 INFO L87 Difference]: Start difference. First operand 3334 states and 7489 transitions. Second operand 3 states. [2019-12-26 23:15:38,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:38,457 INFO L93 Difference]: Finished difference Result 3334 states and 7414 transitions. [2019-12-26 23:15:38,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:15:38,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-12-26 23:15:38,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:38,461 INFO L225 Difference]: With dead ends: 3334 [2019-12-26 23:15:38,462 INFO L226 Difference]: Without dead ends: 3334 [2019-12-26 23:15:38,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:15:38,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3334 states. [2019-12-26 23:15:38,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3334 to 3334. [2019-12-26 23:15:38,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3334 states. [2019-12-26 23:15:38,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3334 states to 3334 states and 7414 transitions. [2019-12-26 23:15:38,512 INFO L78 Accepts]: Start accepts. Automaton has 3334 states and 7414 transitions. Word has length 93 [2019-12-26 23:15:38,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:38,512 INFO L462 AbstractCegarLoop]: Abstraction has 3334 states and 7414 transitions. [2019-12-26 23:15:38,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:15:38,513 INFO L276 IsEmpty]: Start isEmpty. Operand 3334 states and 7414 transitions. [2019-12-26 23:15:38,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:15:38,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:38,523 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] [2019-12-26 23:15:38,524 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:38,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:38,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1261390719, now seen corresponding path program 1 times [2019-12-26 23:15:38,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:38,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617081836] [2019-12-26 23:15:38,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:38,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:15:38,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617081836] [2019-12-26 23:15:38,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:38,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:15:38,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018510237] [2019-12-26 23:15:38,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:15:38,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:38,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:15:38,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:15:38,727 INFO L87 Difference]: Start difference. First operand 3334 states and 7414 transitions. Second operand 7 states. [2019-12-26 23:15:39,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:39,783 INFO L93 Difference]: Finished difference Result 4159 states and 9153 transitions. [2019-12-26 23:15:39,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:15:39,784 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-26 23:15:39,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:39,789 INFO L225 Difference]: With dead ends: 4159 [2019-12-26 23:15:39,790 INFO L226 Difference]: Without dead ends: 4159 [2019-12-26 23:15:39,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:15:39,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4159 states. [2019-12-26 23:15:39,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4159 to 3820. [2019-12-26 23:15:39,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3820 states. [2019-12-26 23:15:39,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3820 states to 3820 states and 8475 transitions. [2019-12-26 23:15:39,856 INFO L78 Accepts]: Start accepts. Automaton has 3820 states and 8475 transitions. Word has length 94 [2019-12-26 23:15:39,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:39,856 INFO L462 AbstractCegarLoop]: Abstraction has 3820 states and 8475 transitions. [2019-12-26 23:15:39,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:15:39,857 INFO L276 IsEmpty]: Start isEmpty. Operand 3820 states and 8475 transitions. [2019-12-26 23:15:39,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:15:39,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:39,867 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] [2019-12-26 23:15:39,867 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:39,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:39,868 INFO L82 PathProgramCache]: Analyzing trace with hash 870783717, now seen corresponding path program 2 times [2019-12-26 23:15:39,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:39,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713520666] [2019-12-26 23:15:39,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:40,057 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-26 23:15:40,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713520666] [2019-12-26 23:15:40,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:40,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:15:40,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667689603] [2019-12-26 23:15:40,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:15:40,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:40,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:15:40,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:15:40,059 INFO L87 Difference]: Start difference. First operand 3820 states and 8475 transitions. Second operand 9 states. [2019-12-26 23:15:40,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:40,359 INFO L93 Difference]: Finished difference Result 5413 states and 11925 transitions. [2019-12-26 23:15:40,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:15:40,359 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-12-26 23:15:40,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:40,368 INFO L225 Difference]: With dead ends: 5413 [2019-12-26 23:15:40,368 INFO L226 Difference]: Without dead ends: 5384 [2019-12-26 23:15:40,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-12-26 23:15:40,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5384 states. [2019-12-26 23:15:40,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5384 to 5248. [2019-12-26 23:15:40,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5248 states. [2019-12-26 23:15:40,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5248 states to 5248 states and 11657 transitions. [2019-12-26 23:15:40,458 INFO L78 Accepts]: Start accepts. Automaton has 5248 states and 11657 transitions. Word has length 94 [2019-12-26 23:15:40,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:40,459 INFO L462 AbstractCegarLoop]: Abstraction has 5248 states and 11657 transitions. [2019-12-26 23:15:40,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:15:40,459 INFO L276 IsEmpty]: Start isEmpty. Operand 5248 states and 11657 transitions. [2019-12-26 23:15:40,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-26 23:15:40,478 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:40,478 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] [2019-12-26 23:15:40,479 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:40,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:40,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1853947751, now seen corresponding path program 1 times [2019-12-26 23:15:40,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:40,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999743784] [2019-12-26 23:15:40,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:41,718 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-26 23:15:41,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999743784] [2019-12-26 23:15:41,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:41,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:15:41,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030314450] [2019-12-26 23:15:41,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:15:41,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:41,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:15:41,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:15:41,721 INFO L87 Difference]: Start difference. First operand 5248 states and 11657 transitions. Second operand 5 states. [2019-12-26 23:15:41,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:41,984 INFO L93 Difference]: Finished difference Result 5267 states and 11678 transitions. [2019-12-26 23:15:41,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:15:41,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-26 23:15:41,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:41,991 INFO L225 Difference]: With dead ends: 5267 [2019-12-26 23:15:41,991 INFO L226 Difference]: Without dead ends: 5257 [2019-12-26 23:15:41,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:15:42,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5257 states. [2019-12-26 23:15:42,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5257 to 5173. [2019-12-26 23:15:42,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5173 states. [2019-12-26 23:15:42,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5173 states to 5173 states and 11518 transitions. [2019-12-26 23:15:42,051 INFO L78 Accepts]: Start accepts. Automaton has 5173 states and 11518 transitions. Word has length 95 [2019-12-26 23:15:42,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:42,051 INFO L462 AbstractCegarLoop]: Abstraction has 5173 states and 11518 transitions. [2019-12-26 23:15:42,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:15:42,052 INFO L276 IsEmpty]: Start isEmpty. Operand 5173 states and 11518 transitions. [2019-12-26 23:15:42,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-26 23:15:42,065 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:42,065 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] [2019-12-26 23:15:42,065 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:42,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:42,066 INFO L82 PathProgramCache]: Analyzing trace with hash -808451493, now seen corresponding path program 1 times [2019-12-26 23:15:42,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:42,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141709409] [2019-12-26 23:15:42,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:42,173 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-26 23:15:42,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141709409] [2019-12-26 23:15:42,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:42,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:15:42,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035349539] [2019-12-26 23:15:42,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:15:42,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:42,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:15:42,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:15:42,175 INFO L87 Difference]: Start difference. First operand 5173 states and 11518 transitions. Second operand 5 states. [2019-12-26 23:15:42,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:42,520 INFO L93 Difference]: Finished difference Result 7766 states and 17342 transitions. [2019-12-26 23:15:42,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:15:42,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-26 23:15:42,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:42,530 INFO L225 Difference]: With dead ends: 7766 [2019-12-26 23:15:42,530 INFO L226 Difference]: Without dead ends: 7766 [2019-12-26 23:15:42,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:15:42,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7766 states. [2019-12-26 23:15:42,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7766 to 6496. [2019-12-26 23:15:42,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6496 states. [2019-12-26 23:15:42,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6496 states to 6496 states and 14427 transitions. [2019-12-26 23:15:42,606 INFO L78 Accepts]: Start accepts. Automaton has 6496 states and 14427 transitions. Word has length 95 [2019-12-26 23:15:42,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:42,606 INFO L462 AbstractCegarLoop]: Abstraction has 6496 states and 14427 transitions. [2019-12-26 23:15:42,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:15:42,606 INFO L276 IsEmpty]: Start isEmpty. Operand 6496 states and 14427 transitions. [2019-12-26 23:15:42,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-26 23:15:42,619 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:42,619 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] [2019-12-26 23:15:42,619 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:42,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:42,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1714824989, now seen corresponding path program 2 times [2019-12-26 23:15:42,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:42,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628759798] [2019-12-26 23:15:42,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:42,711 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-26 23:15:42,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628759798] [2019-12-26 23:15:42,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:42,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:15:42,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620262310] [2019-12-26 23:15:42,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:15:42,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:42,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:15:42,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:15:42,713 INFO L87 Difference]: Start difference. First operand 6496 states and 14427 transitions. Second operand 4 states. [2019-12-26 23:15:43,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:43,019 INFO L93 Difference]: Finished difference Result 12125 states and 26917 transitions. [2019-12-26 23:15:43,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:15:43,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-26 23:15:43,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:43,041 INFO L225 Difference]: With dead ends: 12125 [2019-12-26 23:15:43,041 INFO L226 Difference]: Without dead ends: 12125 [2019-12-26 23:15:43,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:15:43,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12125 states. [2019-12-26 23:15:43,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12125 to 9231. [2019-12-26 23:15:43,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9231 states. [2019-12-26 23:15:43,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9231 states to 9231 states and 20708 transitions. [2019-12-26 23:15:43,215 INFO L78 Accepts]: Start accepts. Automaton has 9231 states and 20708 transitions. Word has length 95 [2019-12-26 23:15:43,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:43,216 INFO L462 AbstractCegarLoop]: Abstraction has 9231 states and 20708 transitions. [2019-12-26 23:15:43,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:15:43,217 INFO L276 IsEmpty]: Start isEmpty. Operand 9231 states and 20708 transitions. [2019-12-26 23:15:43,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-26 23:15:43,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:43,235 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] [2019-12-26 23:15:43,235 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:43,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:43,235 INFO L82 PathProgramCache]: Analyzing trace with hash 900755581, now seen corresponding path program 3 times [2019-12-26 23:15:43,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:43,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237390886] [2019-12-26 23:15:43,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:43,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:43,332 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-26 23:15:43,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237390886] [2019-12-26 23:15:43,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:43,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:15:43,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322154594] [2019-12-26 23:15:43,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:15:43,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:43,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:15:43,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:15:43,335 INFO L87 Difference]: Start difference. First operand 9231 states and 20708 transitions. Second operand 4 states. [2019-12-26 23:15:43,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:43,577 INFO L93 Difference]: Finished difference Result 13230 states and 29262 transitions. [2019-12-26 23:15:43,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:15:43,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-26 23:15:43,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:43,590 INFO L225 Difference]: With dead ends: 13230 [2019-12-26 23:15:43,590 INFO L226 Difference]: Without dead ends: 13230 [2019-12-26 23:15:43,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:15:43,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13230 states. [2019-12-26 23:15:43,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13230 to 10145. [2019-12-26 23:15:43,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10145 states. [2019-12-26 23:15:43,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10145 states to 10145 states and 22726 transitions. [2019-12-26 23:15:43,719 INFO L78 Accepts]: Start accepts. Automaton has 10145 states and 22726 transitions. Word has length 95 [2019-12-26 23:15:43,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:43,720 INFO L462 AbstractCegarLoop]: Abstraction has 10145 states and 22726 transitions. [2019-12-26 23:15:43,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:15:43,720 INFO L276 IsEmpty]: Start isEmpty. Operand 10145 states and 22726 transitions. [2019-12-26 23:15:43,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-26 23:15:43,739 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:43,739 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] [2019-12-26 23:15:43,739 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:43,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:43,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1454974861, now seen corresponding path program 4 times [2019-12-26 23:15:43,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:43,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624628405] [2019-12-26 23:15:43,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:43,887 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-26 23:15:43,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624628405] [2019-12-26 23:15:43,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:43,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:15:43,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254771904] [2019-12-26 23:15:43,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:15:43,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:43,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:15:43,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:15:43,889 INFO L87 Difference]: Start difference. First operand 10145 states and 22726 transitions. Second operand 6 states. [2019-12-26 23:15:44,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:44,074 INFO L93 Difference]: Finished difference Result 15172 states and 33764 transitions. [2019-12-26 23:15:44,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:15:44,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-26 23:15:44,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:44,082 INFO L225 Difference]: With dead ends: 15172 [2019-12-26 23:15:44,082 INFO L226 Difference]: Without dead ends: 5023 [2019-12-26 23:15:44,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:15:44,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5023 states. [2019-12-26 23:15:44,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5023 to 4847. [2019-12-26 23:15:44,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4847 states. [2019-12-26 23:15:44,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4847 states to 4847 states and 10686 transitions. [2019-12-26 23:15:44,161 INFO L78 Accepts]: Start accepts. Automaton has 4847 states and 10686 transitions. Word has length 95 [2019-12-26 23:15:44,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:44,161 INFO L462 AbstractCegarLoop]: Abstraction has 4847 states and 10686 transitions. [2019-12-26 23:15:44,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:15:44,162 INFO L276 IsEmpty]: Start isEmpty. Operand 4847 states and 10686 transitions. [2019-12-26 23:15:44,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:15:44,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:44,172 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] [2019-12-26 23:15:44,172 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:44,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:44,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1693003594, now seen corresponding path program 1 times [2019-12-26 23:15:44,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:44,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455221526] [2019-12-26 23:15:44,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:44,459 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-26 23:15:44,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455221526] [2019-12-26 23:15:44,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:44,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 23:15:44,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070038465] [2019-12-26 23:15:44,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-26 23:15:44,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:44,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-26 23:15:44,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-12-26 23:15:44,461 INFO L87 Difference]: Start difference. First operand 4847 states and 10686 transitions. Second operand 14 states. [2019-12-26 23:15:45,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:45,119 INFO L93 Difference]: Finished difference Result 5226 states and 11373 transitions. [2019-12-26 23:15:45,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 23:15:45,119 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2019-12-26 23:15:45,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:45,125 INFO L225 Difference]: With dead ends: 5226 [2019-12-26 23:15:45,126 INFO L226 Difference]: Without dead ends: 5197 [2019-12-26 23:15:45,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2019-12-26 23:15:45,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5197 states. [2019-12-26 23:15:45,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5197 to 4673. [2019-12-26 23:15:45,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4673 states. [2019-12-26 23:15:45,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4673 states to 4673 states and 10329 transitions. [2019-12-26 23:15:45,176 INFO L78 Accepts]: Start accepts. Automaton has 4673 states and 10329 transitions. Word has length 96 [2019-12-26 23:15:45,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:45,176 INFO L462 AbstractCegarLoop]: Abstraction has 4673 states and 10329 transitions. [2019-12-26 23:15:45,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-26 23:15:45,176 INFO L276 IsEmpty]: Start isEmpty. Operand 4673 states and 10329 transitions. [2019-12-26 23:15:45,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:15:45,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:45,183 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] [2019-12-26 23:15:45,183 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:45,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:45,183 INFO L82 PathProgramCache]: Analyzing trace with hash 46562021, now seen corresponding path program 1 times [2019-12-26 23:15:45,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:45,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934568919] [2019-12-26 23:15:45,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:45,684 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-26 23:15:45,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934568919] [2019-12-26 23:15:45,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:45,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-26 23:15:45,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371266388] [2019-12-26 23:15:45,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-26 23:15:45,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:45,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-26 23:15:45,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2019-12-26 23:15:45,686 INFO L87 Difference]: Start difference. First operand 4673 states and 10329 transitions. Second operand 21 states. [2019-12-26 23:15:47,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:47,057 INFO L93 Difference]: Finished difference Result 6221 states and 13580 transitions. [2019-12-26 23:15:47,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 23:15:47,057 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 96 [2019-12-26 23:15:47,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:47,063 INFO L225 Difference]: With dead ends: 6221 [2019-12-26 23:15:47,063 INFO L226 Difference]: Without dead ends: 6192 [2019-12-26 23:15:47,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=972, Unknown=0, NotChecked=0, Total=1122 [2019-12-26 23:15:47,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6192 states. [2019-12-26 23:15:47,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6192 to 5718. [2019-12-26 23:15:47,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5718 states. [2019-12-26 23:15:47,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5718 states to 5718 states and 12648 transitions. [2019-12-26 23:15:47,121 INFO L78 Accepts]: Start accepts. Automaton has 5718 states and 12648 transitions. Word has length 96 [2019-12-26 23:15:47,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:47,122 INFO L462 AbstractCegarLoop]: Abstraction has 5718 states and 12648 transitions. [2019-12-26 23:15:47,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-26 23:15:47,122 INFO L276 IsEmpty]: Start isEmpty. Operand 5718 states and 12648 transitions. [2019-12-26 23:15:47,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:15:47,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:47,131 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] [2019-12-26 23:15:47,131 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:47,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:47,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1127270605, now seen corresponding path program 2 times [2019-12-26 23:15:47,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:47,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092869550] [2019-12-26 23:15:47,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:47,581 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-26 23:15:47,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092869550] [2019-12-26 23:15:47,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:47,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-26 23:15:47,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278288256] [2019-12-26 23:15:47,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-26 23:15:47,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:47,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-26 23:15:47,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-12-26 23:15:47,583 INFO L87 Difference]: Start difference. First operand 5718 states and 12648 transitions. Second operand 19 states. [2019-12-26 23:15:49,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:49,200 INFO L93 Difference]: Finished difference Result 12600 states and 27737 transitions. [2019-12-26 23:15:49,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 23:15:49,201 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 96 [2019-12-26 23:15:49,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:49,215 INFO L225 Difference]: With dead ends: 12600 [2019-12-26 23:15:49,215 INFO L226 Difference]: Without dead ends: 12571 [2019-12-26 23:15:49,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=239, Invalid=1243, Unknown=0, NotChecked=0, Total=1482 [2019-12-26 23:15:49,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12571 states. [2019-12-26 23:15:49,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12571 to 8020. [2019-12-26 23:15:49,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8020 states. [2019-12-26 23:15:49,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8020 states to 8020 states and 18015 transitions. [2019-12-26 23:15:49,342 INFO L78 Accepts]: Start accepts. Automaton has 8020 states and 18015 transitions. Word has length 96 [2019-12-26 23:15:49,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:49,342 INFO L462 AbstractCegarLoop]: Abstraction has 8020 states and 18015 transitions. [2019-12-26 23:15:49,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-26 23:15:49,342 INFO L276 IsEmpty]: Start isEmpty. Operand 8020 states and 18015 transitions. [2019-12-26 23:15:49,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:15:49,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:49,354 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] [2019-12-26 23:15:49,354 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:49,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:49,354 INFO L82 PathProgramCache]: Analyzing trace with hash 273024232, now seen corresponding path program 1 times [2019-12-26 23:15:49,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:49,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863850574] [2019-12-26 23:15:49,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:49,446 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-26 23:15:49,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863850574] [2019-12-26 23:15:49,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:49,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:15:49,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197927031] [2019-12-26 23:15:49,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:15:49,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:49,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:15:49,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:15:49,448 INFO L87 Difference]: Start difference. First operand 8020 states and 18015 transitions. Second operand 6 states. [2019-12-26 23:15:49,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:49,813 INFO L93 Difference]: Finished difference Result 8260 states and 18428 transitions. [2019-12-26 23:15:49,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:15:49,813 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-26 23:15:49,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:49,821 INFO L225 Difference]: With dead ends: 8260 [2019-12-26 23:15:49,822 INFO L226 Difference]: Without dead ends: 8136 [2019-12-26 23:15:49,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:15:49,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8136 states. [2019-12-26 23:15:49,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8136 to 7844. [2019-12-26 23:15:49,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7844 states. [2019-12-26 23:15:49,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7844 states to 7844 states and 17567 transitions. [2019-12-26 23:15:49,895 INFO L78 Accepts]: Start accepts. Automaton has 7844 states and 17567 transitions. Word has length 97 [2019-12-26 23:15:49,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:49,896 INFO L462 AbstractCegarLoop]: Abstraction has 7844 states and 17567 transitions. [2019-12-26 23:15:49,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:15:49,896 INFO L276 IsEmpty]: Start isEmpty. Operand 7844 states and 17567 transitions. [2019-12-26 23:15:49,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:15:49,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:49,903 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] [2019-12-26 23:15:49,903 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:49,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:49,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1635016551, now seen corresponding path program 1 times [2019-12-26 23:15:49,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:49,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410996450] [2019-12-26 23:15:49,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:50,106 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-26 23:15:50,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410996450] [2019-12-26 23:15:50,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:50,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:15:50,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25801993] [2019-12-26 23:15:50,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:15:50,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:50,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:15:50,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:15:50,108 INFO L87 Difference]: Start difference. First operand 7844 states and 17567 transitions. Second operand 7 states. [2019-12-26 23:15:50,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:50,219 INFO L93 Difference]: Finished difference Result 7836 states and 17553 transitions. [2019-12-26 23:15:50,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:15:50,220 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-26 23:15:50,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:50,228 INFO L225 Difference]: With dead ends: 7836 [2019-12-26 23:15:50,229 INFO L226 Difference]: Without dead ends: 7061 [2019-12-26 23:15:50,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:15:50,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7061 states. [2019-12-26 23:15:50,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7061 to 6858. [2019-12-26 23:15:50,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6858 states. [2019-12-26 23:15:50,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6858 states to 6858 states and 15362 transitions. [2019-12-26 23:15:50,300 INFO L78 Accepts]: Start accepts. Automaton has 6858 states and 15362 transitions. Word has length 97 [2019-12-26 23:15:50,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:50,301 INFO L462 AbstractCegarLoop]: Abstraction has 6858 states and 15362 transitions. [2019-12-26 23:15:50,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:15:50,301 INFO L276 IsEmpty]: Start isEmpty. Operand 6858 states and 15362 transitions. [2019-12-26 23:15:50,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:15:50,308 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:50,308 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] [2019-12-26 23:15:50,308 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:50,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:50,308 INFO L82 PathProgramCache]: Analyzing trace with hash 361616868, now seen corresponding path program 1 times [2019-12-26 23:15:50,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:50,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502214760] [2019-12-26 23:15:50,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:50,452 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-26 23:15:50,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502214760] [2019-12-26 23:15:50,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:50,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:15:50,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950195512] [2019-12-26 23:15:50,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:15:50,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:50,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:15:50,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:15:50,454 INFO L87 Difference]: Start difference. First operand 6858 states and 15362 transitions. Second operand 4 states. [2019-12-26 23:15:50,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:50,510 INFO L93 Difference]: Finished difference Result 4946 states and 10886 transitions. [2019-12-26 23:15:50,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:15:50,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-26 23:15:50,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:50,517 INFO L225 Difference]: With dead ends: 4946 [2019-12-26 23:15:50,517 INFO L226 Difference]: Without dead ends: 4946 [2019-12-26 23:15:50,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:15:50,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4946 states. [2019-12-26 23:15:50,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4946 to 4910. [2019-12-26 23:15:50,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4910 states. [2019-12-26 23:15:50,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4910 states to 4910 states and 10809 transitions. [2019-12-26 23:15:50,584 INFO L78 Accepts]: Start accepts. Automaton has 4910 states and 10809 transitions. Word has length 97 [2019-12-26 23:15:50,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:50,584 INFO L462 AbstractCegarLoop]: Abstraction has 4910 states and 10809 transitions. [2019-12-26 23:15:50,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:15:50,585 INFO L276 IsEmpty]: Start isEmpty. Operand 4910 states and 10809 transitions. [2019-12-26 23:15:50,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-26 23:15:50,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:50,589 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] [2019-12-26 23:15:50,589 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:50,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:50,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1860317714, now seen corresponding path program 1 times [2019-12-26 23:15:50,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:50,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421562218] [2019-12-26 23:15:50,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:50,626 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-26 23:15:50,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421562218] [2019-12-26 23:15:50,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:50,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:15:50,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277504217] [2019-12-26 23:15:50,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:15:50,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:50,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:15:50,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:15:50,628 INFO L87 Difference]: Start difference. First operand 4910 states and 10809 transitions. Second operand 3 states. [2019-12-26 23:15:50,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:50,727 INFO L93 Difference]: Finished difference Result 4402 states and 9213 transitions. [2019-12-26 23:15:50,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:15:50,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-12-26 23:15:50,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:50,735 INFO L225 Difference]: With dead ends: 4402 [2019-12-26 23:15:50,735 INFO L226 Difference]: Without dead ends: 4388 [2019-12-26 23:15:50,736 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-26 23:15:50,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4388 states. [2019-12-26 23:15:50,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4388 to 3600. [2019-12-26 23:15:50,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3600 states. [2019-12-26 23:15:50,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3600 states to 3600 states and 7695 transitions. [2019-12-26 23:15:50,821 INFO L78 Accepts]: Start accepts. Automaton has 3600 states and 7695 transitions. Word has length 98 [2019-12-26 23:15:50,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:50,821 INFO L462 AbstractCegarLoop]: Abstraction has 3600 states and 7695 transitions. [2019-12-26 23:15:50,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:15:50,822 INFO L276 IsEmpty]: Start isEmpty. Operand 3600 states and 7695 transitions. [2019-12-26 23:15:50,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-26 23:15:50,828 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:50,829 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] [2019-12-26 23:15:50,829 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:50,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:50,829 INFO L82 PathProgramCache]: Analyzing trace with hash 272691207, now seen corresponding path program 1 times [2019-12-26 23:15:50,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:50,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746264447] [2019-12-26 23:15:50,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:51,235 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-26 23:15:51,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746264447] [2019-12-26 23:15:51,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:51,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 23:15:51,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980859175] [2019-12-26 23:15:51,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 23:15:51,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:51,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 23:15:51,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:15:51,243 INFO L87 Difference]: Start difference. First operand 3600 states and 7695 transitions. Second operand 12 states. [2019-12-26 23:15:52,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:52,103 INFO L93 Difference]: Finished difference Result 7359 states and 15810 transitions. [2019-12-26 23:15:52,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 23:15:52,104 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-12-26 23:15:52,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:52,111 INFO L225 Difference]: With dead ends: 7359 [2019-12-26 23:15:52,111 INFO L226 Difference]: Without dead ends: 5190 [2019-12-26 23:15:52,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2019-12-26 23:15:52,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5190 states. [2019-12-26 23:15:52,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5190 to 3659. [2019-12-26 23:15:52,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3659 states. [2019-12-26 23:15:52,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3659 states to 3659 states and 7770 transitions. [2019-12-26 23:15:52,156 INFO L78 Accepts]: Start accepts. Automaton has 3659 states and 7770 transitions. Word has length 98 [2019-12-26 23:15:52,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:52,156 INFO L462 AbstractCegarLoop]: Abstraction has 3659 states and 7770 transitions. [2019-12-26 23:15:52,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 23:15:52,156 INFO L276 IsEmpty]: Start isEmpty. Operand 3659 states and 7770 transitions. [2019-12-26 23:15:52,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-26 23:15:52,159 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:52,159 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] [2019-12-26 23:15:52,159 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:52,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:52,159 INFO L82 PathProgramCache]: Analyzing trace with hash 741591247, now seen corresponding path program 1 times [2019-12-26 23:15:52,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:52,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132605109] [2019-12-26 23:15:52,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:52,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-26 23:15:52,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132605109] [2019-12-26 23:15:52,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:52,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-26 23:15:52,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906340090] [2019-12-26 23:15:52,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-26 23:15:52,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:52,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-26 23:15:52,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-12-26 23:15:52,782 INFO L87 Difference]: Start difference. First operand 3659 states and 7770 transitions. Second operand 17 states. [2019-12-26 23:15:54,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:54,247 INFO L93 Difference]: Finished difference Result 5723 states and 12165 transitions. [2019-12-26 23:15:54,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 23:15:54,247 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 98 [2019-12-26 23:15:54,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:54,254 INFO L225 Difference]: With dead ends: 5723 [2019-12-26 23:15:54,254 INFO L226 Difference]: Without dead ends: 4194 [2019-12-26 23:15:54,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=178, Invalid=692, Unknown=0, NotChecked=0, Total=870 [2019-12-26 23:15:54,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4194 states. [2019-12-26 23:15:54,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4194 to 3797. [2019-12-26 23:15:54,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3797 states. [2019-12-26 23:15:54,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3797 states to 3797 states and 7975 transitions. [2019-12-26 23:15:54,293 INFO L78 Accepts]: Start accepts. Automaton has 3797 states and 7975 transitions. Word has length 98 [2019-12-26 23:15:54,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:54,293 INFO L462 AbstractCegarLoop]: Abstraction has 3797 states and 7975 transitions. [2019-12-26 23:15:54,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-26 23:15:54,293 INFO L276 IsEmpty]: Start isEmpty. Operand 3797 states and 7975 transitions. [2019-12-26 23:15:54,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-26 23:15:54,297 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:54,297 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] [2019-12-26 23:15:54,298 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:54,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:54,298 INFO L82 PathProgramCache]: Analyzing trace with hash 402744400, now seen corresponding path program 1 times [2019-12-26 23:15:54,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:54,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251181175] [2019-12-26 23:15:54,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:15:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:15:54,488 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:15:54,488 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:15:54,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1393] [1393] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_48| 0 0))) (and (= 0 v_~y$r_buff0_thd2~0_754) (= 0 v_~y$w_buff0~0_354) (= v_~y$r_buff1_thd0~0_369 0) (= 0 v_~__unbuffered_cnt~0_79) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y~0_364 0) (= |v_#NULL.offset_7| 0) (= 0 v_~x~0_107) (= v_~y$w_buff1_used~0_638 0) (= v_~y$r_buff0_thd0~0_393 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_1402 0) (= v_~main$tmp_guard0~0_23 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1647~0.base_19| 4)) (= v_~y$r_buff1_thd1~0_311 0) (= v_~main$tmp_guard1~0_29 0) (= v_~weak$$choice2~0_312 0) (= 0 v_~y$read_delayed_var~0.base_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t1647~0.base_19|) 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1647~0.base_19| 1) |v_#valid_46|) (= 0 |v_#NULL.base_7|) (= v_~y$w_buff1~0_285 0) (= v_~y$mem_tmp~0_229 0) (= v_~__unbuffered_p1_EBX~0_24 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1647~0.base_19|) (= 0 v_~__unbuffered_p1_EAX~0_36) (= v_~y$flush_delayed~0_258 0) (= 0 v_~weak$$choice0~0_214) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1647~0.base_19| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1647~0.base_19|) |v_ULTIMATE.start_main_~#t1647~0.offset_15| 0))) (= 0 |v_ULTIMATE.start_main_~#t1647~0.offset_15|) (< 0 |v_#StackHeapBarrier_13|) (= 0 v_~y$r_buff1_thd2~0_431) (= v_~y$r_buff0_thd1~0_259 0) (= 0 v_~__unbuffered_p0_EAX~0_38))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~nondet76=|v_ULTIMATE.start_main_#t~nondet76_83|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_50|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_57|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_25|, ULTIMATE.start_main_#t~ite96=|v_ULTIMATE.start_main_#t~ite96_33|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_55|, ULTIMATE.start_main_#t~ite94=|v_ULTIMATE.start_main_#t~ite94_59|, ~y$mem_tmp~0=v_~y$mem_tmp~0_229, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ULTIMATE.start_main_#t~ite92=|v_ULTIMATE.start_main_#t~ite92_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_25|, ULTIMATE.start_main_~#t1648~0.offset=|v_ULTIMATE.start_main_~#t1648~0.offset_13|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_259, ~y$flush_delayed~0=v_~y$flush_delayed~0_258, #length=|v_#length_15|, ULTIMATE.start_main_~#t1648~0.base=|v_ULTIMATE.start_main_~#t1648~0.base_17|, ULTIMATE.start_main_#t~nondet68=|v_ULTIMATE.start_main_#t~nondet68_21|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_44|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_25|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_56|, ~weak$$choice0~0=v_~weak$$choice0~0_214, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_37|, ~y$w_buff1~0=v_~y$w_buff1~0_285, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_54|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_754, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_369, ~x~0=v_~x~0_107, ULTIMATE.start_main_#t~nondet75=|v_ULTIMATE.start_main_#t~nondet75_83|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t1647~0.offset=|v_ULTIMATE.start_main_~#t1647~0.offset_15|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_1402, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_33|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_49|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_45|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_95|, ULTIMATE.start_main_#t~ite95=|v_ULTIMATE.start_main_#t~ite95_60|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_311, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_31|, ULTIMATE.start_main_#t~ite93=|v_ULTIMATE.start_main_#t~ite93_29|, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_27|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_30|, ~y$w_buff0~0=v_~y$w_buff0~0_354, ~y~0=v_~y~0_364, ULTIMATE.start_main_~#t1647~0.base=|v_ULTIMATE.start_main_~#t1647~0.base_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ULTIMATE.start_main_#t~nondet67=|v_ULTIMATE.start_main_#t~nondet67_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_23|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_49|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_52|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_431, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_38|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_62|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_393, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_9|, ~weak$$choice2~0=v_~weak$$choice2~0_312, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_638} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet76, #NULL.offset, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite73, ULTIMATE.start_main_#t~ite96, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite71, ULTIMATE.start_main_#t~ite94, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_#t~ite92, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~ite90, ULTIMATE.start_main_~#t1648~0.offset, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1648~0.base, ULTIMATE.start_main_#t~nondet68, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite80, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_#t~nondet75, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1647~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite69, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite74, ULTIMATE.start_main_#t~ite95, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite93, ULTIMATE.start_main_#t~ite70, ULTIMATE.start_main_#t~ite91, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_~#t1647~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet67, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite78, #NULL.base, ULTIMATE.start_main_#t~ite97, ULTIMATE.start_main_#t~ite85, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 23:15:54,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1352] [1352] L822-1-->L824: Formula: (and (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1648~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t1648~0.offset_10|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1648~0.base_11| 4) |v_#length_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1648~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1648~0.base_11|)) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1648~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1648~0.base_11|) |v_ULTIMATE.start_main_~#t1648~0.offset_10| 1))) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1648~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet67=|v_ULTIMATE.start_main_#t~nondet67_6|, ULTIMATE.start_main_~#t1648~0.offset=|v_ULTIMATE.start_main_~#t1648~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1648~0.base=|v_ULTIMATE.start_main_~#t1648~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet67, ULTIMATE.start_main_~#t1648~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1648~0.base] because there is no mapped edge [2019-12-26 23:15:54,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1320] [1320] L729-2-->L729-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out-1383689362| |P0Thread1of1ForFork0_#t~ite3_Out-1383689362|)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1383689362 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd1~0_In-1383689362 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= |P0Thread1of1ForFork0_#t~ite3_Out-1383689362| ~y~0_In-1383689362)) (and (= |P0Thread1of1ForFork0_#t~ite3_Out-1383689362| ~y$w_buff1~0_In-1383689362) .cse0 (not .cse2) (not .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1383689362, ~y$w_buff1~0=~y$w_buff1~0_In-1383689362, ~y~0=~y~0_In-1383689362, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1383689362} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1383689362, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1383689362|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-1383689362|, ~y$w_buff1~0=~y$w_buff1~0_In-1383689362, ~y~0=~y~0_In-1383689362, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1383689362} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-26 23:15:54,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1302] [1302] L730-->L730-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In979218650 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In979218650 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In979218650 |P0Thread1of1ForFork0_#t~ite5_Out979218650|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out979218650|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In979218650, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In979218650} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out979218650|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In979218650, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In979218650} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:15:54,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1298] [1298] L731-->L731-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd1~0_In497907223 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In497907223 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In497907223 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In497907223 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out497907223| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out497907223| ~y$w_buff1_used~0_In497907223)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In497907223, ~y$w_buff0_used~0=~y$w_buff0_used~0_In497907223, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In497907223, ~y$w_buff1_used~0=~y$w_buff1_used~0_In497907223} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out497907223|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In497907223, ~y$w_buff0_used~0=~y$w_buff0_used~0_In497907223, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In497907223, ~y$w_buff1_used~0=~y$w_buff1_used~0_In497907223} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:15:54,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1330] [1330] L732-->L732-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-247193839 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-247193839 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In-247193839 |P0Thread1of1ForFork0_#t~ite7_Out-247193839|)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-247193839|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-247193839, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-247193839} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-247193839, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-247193839|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-247193839} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-26 23:15:54,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1295] [1295] L733-->L733-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In276309187 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In276309187 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In276309187 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd1~0_In276309187 256) 0))) (or (and (= ~y$r_buff1_thd1~0_In276309187 |P0Thread1of1ForFork0_#t~ite8_Out276309187|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out276309187|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In276309187, ~y$w_buff0_used~0=~y$w_buff0_used~0_In276309187, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In276309187, ~y$w_buff1_used~0=~y$w_buff1_used~0_In276309187} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In276309187, ~y$w_buff0_used~0=~y$w_buff0_used~0_In276309187, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out276309187|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In276309187, ~y$w_buff1_used~0=~y$w_buff1_used~0_In276309187} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:15:54,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1314] [1314] L739-2-->L739-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1626850303 256))) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-1626850303 256) 0)) (.cse0 (= |P0Thread1of1ForFork0_#t~ite10_Out-1626850303| |P0Thread1of1ForFork0_#t~ite9_Out-1626850303|))) (or (and .cse0 (= ~y$w_buff1~0_In-1626850303 |P0Thread1of1ForFork0_#t~ite9_Out-1626850303|) (not .cse1) (not .cse2)) (and (or .cse1 .cse2) .cse0 (= |P0Thread1of1ForFork0_#t~ite9_Out-1626850303| ~y~0_In-1626850303)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1626850303, ~y$w_buff1~0=~y$w_buff1~0_In-1626850303, ~y~0=~y~0_In-1626850303, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1626850303} OutVars{P0Thread1of1ForFork0_#t~ite10=|P0Thread1of1ForFork0_#t~ite10_Out-1626850303|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1626850303, P0Thread1of1ForFork0_#t~ite9=|P0Thread1of1ForFork0_#t~ite9_Out-1626850303|, ~y$w_buff1~0=~y$w_buff1~0_In-1626850303, ~y~0=~y~0_In-1626850303, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1626850303} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite10, P0Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-26 23:15:54,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1261] [1261] P1ENTRY-->L4-3: Formula: (and (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_33 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_31|) (= v_~y$w_buff0_used~0_458 1) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_31|) (= v_~y$w_buff0_used~0_459 v_~y$w_buff1_used~0_217) (= v_~x~0_34 1) (= v_~y$w_buff1~0_88 v_~y$w_buff0~0_113) (= v_P1Thread1of1ForFork1_~arg.base_31 |v_P1Thread1of1ForFork1_#in~arg.base_31|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_31| v_P1Thread1of1ForFork1_~arg.offset_31) (= (mod v_~y$w_buff1_used~0_217 256) 0) (= 1 v_~y$w_buff0~0_112)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_459, ~y$w_buff0~0=v_~y$w_buff0~0_113, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_31|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_31|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_33, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_31, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_458, ~y$w_buff1~0=v_~y$w_buff1~0_88, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_31|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_31, ~y$w_buff0~0=v_~y$w_buff0~0_112, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_31|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_31|, ~x~0=v_~x~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_217} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 23:15:54,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1328] [1328] L771-2-->L771-4: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1017066641 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1017066641 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite17_Out-1017066641| ~y$w_buff1~0_In-1017066641)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite17_Out-1017066641| ~y$w_buff0~0_In-1017066641)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1017066641, ~y$w_buff1~0=~y$w_buff1~0_In-1017066641, ~y$w_buff0~0=~y$w_buff0~0_In-1017066641, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1017066641} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1017066641, ~y$w_buff1~0=~y$w_buff1~0_In-1017066641, ~y$w_buff0~0=~y$w_buff0~0_In-1017066641, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1017066641, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-1017066641|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-26 23:15:54,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1231] [1231] L771-4-->L772: Formula: (= v_~y~0_57 |v_P1Thread1of1ForFork1_#t~ite17_10|) InVars {P1Thread1of1ForFork1_#t~ite17=|v_P1Thread1of1ForFork1_#t~ite17_10|} OutVars{P1Thread1of1ForFork1_#t~ite18=|v_P1Thread1of1ForFork1_#t~ite18_13|, ~y~0=v_~y~0_57, P1Thread1of1ForFork1_#t~ite17=|v_P1Thread1of1ForFork1_#t~ite17_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, ~y~0, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-26 23:15:54,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1292] [1292] L776-->L777: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_153 256))) (= v_~y$r_buff0_thd2~0_342 v_~y$r_buff0_thd2~0_341)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_342, ~weak$$choice2~0=v_~weak$$choice2~0_153} OutVars{P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_17|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_341, P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_14|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_10|, ~weak$$choice2~0=v_~weak$$choice2~0_153} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-26 23:15:54,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1312] [1312] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In2131019813 256) 0))) (or (and (= ~y~0_In2131019813 |P1Thread1of1ForFork1_#t~ite37_Out2131019813|) .cse0) (and (= |P1Thread1of1ForFork1_#t~ite37_Out2131019813| ~y$mem_tmp~0_In2131019813) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In2131019813, ~y$flush_delayed~0=~y$flush_delayed~0_In2131019813, ~y~0=~y~0_In2131019813} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In2131019813, ~y$flush_delayed~0=~y$flush_delayed~0_In2131019813, ~y~0=~y~0_In2131019813, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out2131019813|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 23:15:54,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1306] [1306] L787-2-->L787-5: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In242908991 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In242908991 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite40_Out242908991| |P1Thread1of1ForFork1_#t~ite41_Out242908991|))) (or (and (= |P1Thread1of1ForFork1_#t~ite40_Out242908991| ~y$w_buff0~0_In242908991) (not .cse0) (not .cse1) .cse2) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite40_Out242908991| ~y$w_buff1~0_In242908991) .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In242908991, ~y$w_buff1~0=~y$w_buff1~0_In242908991, ~y$w_buff0~0=~y$w_buff0~0_In242908991, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In242908991} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In242908991, ~y$w_buff1~0=~y$w_buff1~0_In242908991, P1Thread1of1ForFork1_#t~ite41=|P1Thread1of1ForFork1_#t~ite41_Out242908991|, P1Thread1of1ForFork1_#t~ite40=|P1Thread1of1ForFork1_#t~ite40_Out242908991|, ~y$w_buff0~0=~y$w_buff0~0_In242908991, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In242908991} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite41, P1Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-26 23:15:54,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1227] [1227] L792-->L793: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_61 256))) (= v_~y$r_buff0_thd2~0_127 v_~y$r_buff0_thd2~0_126)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_127, ~weak$$choice2~0=v_~weak$$choice2~0_61} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_126, P1Thread1of1ForFork1_#t~ite56=|v_P1Thread1of1ForFork1_#t~ite56_11|, P1Thread1of1ForFork1_#t~ite55=|v_P1Thread1of1ForFork1_#t~ite55_11|, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_14|, ~weak$$choice2~0=v_~weak$$choice2~0_61} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite56, P1Thread1of1ForFork1_#t~ite55, P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-26 23:15:54,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1321] [1321] L795-->L795-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In388563804 256)))) (or (and (not .cse0) (= ~y$mem_tmp~0_In388563804 |P1Thread1of1ForFork1_#t~ite60_Out388563804|)) (and (= |P1Thread1of1ForFork1_#t~ite60_Out388563804| ~y~0_In388563804) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In388563804, ~y$flush_delayed~0=~y$flush_delayed~0_In388563804, ~y~0=~y~0_In388563804} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In388563804, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out388563804|, ~y$flush_delayed~0=~y$flush_delayed~0_In388563804, ~y~0=~y~0_In388563804} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-26 23:15:54,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1313] [1313] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2055296285 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2055296285 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite63_Out-2055296285| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite63_Out-2055296285| ~y$w_buff0_used~0_In-2055296285) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2055296285, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2055296285} OutVars{P1Thread1of1ForFork1_#t~ite63=|P1Thread1of1ForFork1_#t~ite63_Out-2055296285|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2055296285, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2055296285} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite63] because there is no mapped edge [2019-12-26 23:15:54,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1297] [1297] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In1242725812 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1242725812 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1242725812 |P0Thread1of1ForFork0_#t~ite11_Out1242725812|)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite11_Out1242725812|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1242725812, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1242725812} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out1242725812|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1242725812, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1242725812} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-26 23:15:54,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1337] [1337] L801-->L801-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd2~0_In-78665761 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-78665761 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-78665761 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-78665761 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite64_Out-78665761|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite64_Out-78665761| ~y$w_buff1_used~0_In-78665761) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-78665761, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-78665761, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-78665761, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-78665761} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-78665761, P1Thread1of1ForFork1_#t~ite64=|P1Thread1of1ForFork1_#t~ite64_Out-78665761|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-78665761, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-78665761, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-78665761} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite64] because there is no mapped edge [2019-12-26 23:15:54,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1316] [1316] L802-->L803: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-674504155 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-674504155 256) 0))) (or (and (= ~y$r_buff0_thd2~0_In-674504155 ~y$r_buff0_thd2~0_Out-674504155) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~y$r_buff0_thd2~0_Out-674504155 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-674504155, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-674504155} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-674504155, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-674504155, P1Thread1of1ForFork1_#t~ite65=|P1Thread1of1ForFork1_#t~ite65_Out-674504155|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite65] because there is no mapped edge [2019-12-26 23:15:54,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1325] [1325] L803-->L803-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In309897563 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In309897563 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In309897563 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In309897563 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite66_Out309897563| 0)) (and (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In309897563 |P1Thread1of1ForFork1_#t~ite66_Out309897563|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In309897563, ~y$w_buff0_used~0=~y$w_buff0_used~0_In309897563, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In309897563, ~y$w_buff1_used~0=~y$w_buff1_used~0_In309897563} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In309897563, ~y$w_buff0_used~0=~y$w_buff0_used~0_In309897563, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In309897563, P1Thread1of1ForFork1_#t~ite66=|P1Thread1of1ForFork1_#t~ite66_Out309897563|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In309897563} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite66] because there is no mapped edge [2019-12-26 23:15:54,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1357] [1357] L803-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= v_~y$r_buff1_thd2~0_224 |v_P1Thread1of1ForFork1_#t~ite66_34|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite66=|v_P1Thread1of1ForFork1_#t~ite66_34|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_224, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#t~ite66=|v_P1Thread1of1ForFork1_#t~ite66_33|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite66, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 23:15:54,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1310] [1310] L741-->L741-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd1~0_In-1776466498 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1776466498 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-1776466498 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1776466498 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite12_Out-1776466498|)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite12_Out-1776466498| ~y$w_buff1_used~0_In-1776466498) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1776466498, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1776466498, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1776466498, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1776466498} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1776466498, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1776466498, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1776466498, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out-1776466498|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1776466498} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-26 23:15:54,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1304] [1304] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1726038393 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1726038393 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite13_Out-1726038393| 0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite13_Out-1726038393| ~y$r_buff0_thd1~0_In-1726038393) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1726038393, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1726038393} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1726038393, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1726038393, P0Thread1of1ForFork0_#t~ite13=|P0Thread1of1ForFork0_#t~ite13_Out-1726038393|} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-26 23:15:54,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1338] [1338] L743-->L743-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1225881469 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In1225881469 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1225881469 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In1225881469 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite14_Out1225881469|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$r_buff1_thd1~0_In1225881469 |P0Thread1of1ForFork0_#t~ite14_Out1225881469|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1225881469, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1225881469, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1225881469, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1225881469} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1225881469, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1225881469, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1225881469, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_Out1225881469|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1225881469} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-26 23:15:54,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1340] [1340] L743-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_117 |v_P0Thread1of1ForFork0_#t~ite14_28|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, P0Thread1of1ForFork0_#t~ite14=|v_P0Thread1of1ForFork0_#t~ite14_28|} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_117, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P0Thread1of1ForFork0_#t~ite14=|v_P0Thread1of1ForFork0_#t~ite14_27|} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-26 23:15:54,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1274] [1274] L824-1-->L830: Formula: (and (= v_~main$tmp_guard0~0_9 1) (= 2 v_~__unbuffered_cnt~0_26)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26} OutVars{ULTIMATE.start_main_#t~nondet68=|v_ULTIMATE.start_main_#t~nondet68_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet68, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 23:15:54,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1336] [1336] L830-2-->L830-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-786061347 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-786061347 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite69_Out-786061347| ~y$w_buff1~0_In-786061347)) (and (or .cse1 .cse0) (= ~y~0_In-786061347 |ULTIMATE.start_main_#t~ite69_Out-786061347|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-786061347, ~y~0=~y~0_In-786061347, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-786061347, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-786061347} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-786061347, ULTIMATE.start_main_#t~ite69=|ULTIMATE.start_main_#t~ite69_Out-786061347|, ~y~0=~y~0_In-786061347, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-786061347, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-786061347} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite69] because there is no mapped edge [2019-12-26 23:15:54,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1254] [1254] L830-4-->L831: Formula: (= v_~y~0_92 |v_ULTIMATE.start_main_#t~ite69_10|) InVars {ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_10|} OutVars{ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_13|, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_9|, ~y~0=v_~y~0_92} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite70, ULTIMATE.start_main_#t~ite69, ~y~0] because there is no mapped edge [2019-12-26 23:15:54,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1311] [1311] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1764135907 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1764135907 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite71_Out-1764135907| 0)) (and (= ~y$w_buff0_used~0_In-1764135907 |ULTIMATE.start_main_#t~ite71_Out-1764135907|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1764135907, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1764135907} OutVars{ULTIMATE.start_main_#t~ite71=|ULTIMATE.start_main_#t~ite71_Out-1764135907|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1764135907, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1764135907} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite71] because there is no mapped edge [2019-12-26 23:15:54,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1335] [1335] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-357875098 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-357875098 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-357875098 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-357875098 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-357875098 |ULTIMATE.start_main_#t~ite72_Out-357875098|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite72_Out-357875098|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-357875098, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-357875098, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-357875098, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-357875098} OutVars{ULTIMATE.start_main_#t~ite72=|ULTIMATE.start_main_#t~ite72_Out-357875098|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-357875098, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-357875098, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-357875098, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-357875098} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite72] because there is no mapped edge [2019-12-26 23:15:54,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1300] [1300] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In680677963 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In680677963 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite73_Out680677963| 0)) (and (= |ULTIMATE.start_main_#t~ite73_Out680677963| ~y$r_buff0_thd0~0_In680677963) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In680677963, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In680677963} OutVars{ULTIMATE.start_main_#t~ite73=|ULTIMATE.start_main_#t~ite73_Out680677963|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In680677963, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In680677963} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite73] because there is no mapped edge [2019-12-26 23:15:54,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1332] [1332] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In639163076 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In639163076 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In639163076 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In639163076 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite74_Out639163076|)) (and (= ~y$r_buff1_thd0~0_In639163076 |ULTIMATE.start_main_#t~ite74_Out639163076|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In639163076, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In639163076, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In639163076, ~y$w_buff1_used~0=~y$w_buff1_used~0_In639163076} OutVars{ULTIMATE.start_main_#t~ite74=|ULTIMATE.start_main_#t~ite74_Out639163076|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In639163076, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In639163076, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In639163076, ~y$w_buff1_used~0=~y$w_buff1_used~0_In639163076} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite74] because there is no mapped edge [2019-12-26 23:15:54,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1296] [1296] L849-->L849-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1248123080 256) 0))) (or (and .cse0 (= ~y~0_In-1248123080 |ULTIMATE.start_main_#t~ite97_Out-1248123080|)) (and (= ~y$mem_tmp~0_In-1248123080 |ULTIMATE.start_main_#t~ite97_Out-1248123080|) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1248123080, ~y$flush_delayed~0=~y$flush_delayed~0_In-1248123080, ~y~0=~y~0_In-1248123080} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1248123080, ~y$flush_delayed~0=~y$flush_delayed~0_In-1248123080, ~y~0=~y~0_In-1248123080, ULTIMATE.start_main_#t~ite97=|ULTIMATE.start_main_#t~ite97_Out-1248123080|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite97] because there is no mapped edge [2019-12-26 23:15:54,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1388] [1388] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_26 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~y~0_361 |v_ULTIMATE.start_main_#t~ite97_46|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~y$flush_delayed~0_254 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_46|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_254, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~y~0=v_~y~0_361, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_45|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite97] because there is no mapped edge [2019-12-26 23:15:54,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:15:54 BasicIcfg [2019-12-26 23:15:54,708 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:15:54,709 INFO L168 Benchmark]: Toolchain (without parser) took 60061.96 ms. Allocated memory was 145.8 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 101.7 MB in the beginning and 874.6 MB in the end (delta: -772.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-26 23:15:54,710 INFO L168 Benchmark]: CDTParser took 1.38 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-26 23:15:54,710 INFO L168 Benchmark]: CACSL2BoogieTranslator took 854.21 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 101.3 MB in the beginning and 153.2 MB in the end (delta: -51.9 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-26 23:15:54,711 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.02 ms. Allocated memory is still 202.4 MB. Free memory was 153.2 MB in the beginning and 149.3 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:15:54,711 INFO L168 Benchmark]: Boogie Preprocessor took 49.47 ms. Allocated memory is still 202.4 MB. Free memory was 149.3 MB in the beginning and 146.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-26 23:15:54,711 INFO L168 Benchmark]: RCFGBuilder took 1193.78 ms. Allocated memory was 202.4 MB in the beginning and 236.5 MB in the end (delta: 34.1 MB). Free memory was 146.0 MB in the beginning and 190.3 MB in the end (delta: -44.4 MB). Peak memory consumption was 64.0 MB. Max. memory is 7.1 GB. [2019-12-26 23:15:54,712 INFO L168 Benchmark]: TraceAbstraction took 57866.24 ms. Allocated memory was 236.5 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 190.3 MB in the beginning and 874.6 MB in the end (delta: -684.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-26 23:15:54,714 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.38 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 854.21 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 101.3 MB in the beginning and 153.2 MB in the end (delta: -51.9 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 93.02 ms. Allocated memory is still 202.4 MB. Free memory was 153.2 MB in the beginning and 149.3 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.47 ms. Allocated memory is still 202.4 MB. Free memory was 149.3 MB in the beginning and 146.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1193.78 ms. Allocated memory was 202.4 MB in the beginning and 236.5 MB in the end (delta: 34.1 MB). Free memory was 146.0 MB in the beginning and 190.3 MB in the end (delta: -44.4 MB). Peak memory consumption was 64.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 57866.24 ms. Allocated memory was 236.5 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 190.3 MB in the beginning and 874.6 MB in the end (delta: -684.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.7s, 244 ProgramPointsBefore, 155 ProgramPointsAfterwards, 326 TransitionsBefore, 192 TransitionsAfterwards, 49222 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 78 ConcurrentYvCompositions, 48 ChoiceCompositions, 16023 VarBasedMoverChecksPositive, 415 VarBasedMoverChecksNegative, 104 SemBasedMoverChecksPositive, 452 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.6s, 0 MoverChecksTotal, 282427 CheckedPairsTotal, 142 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1647, ((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] [L726] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=2, 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] [L729] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=2, 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] [L824] FCALL, FORK 0 pthread_create(&t1648, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=2, 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] [L729] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L730] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L731] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L732] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L733] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L736] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=2, 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] [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=2, 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] [L761] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L762] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L763] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L764] 2 y$r_buff0_thd2 = (_Bool)1 [L767] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 2 y$flush_delayed = weak$$choice2 [L770] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L771] 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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L772] 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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L772] 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)) [L773] 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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L773] 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)) [L774] 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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L774] 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)) [L775] 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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L775] 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_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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L777] 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)) [L778] 2 __unbuffered_p1_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=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L779] 2 y = y$flush_delayed ? y$mem_tmp : y [L780] 2 y$flush_delayed = (_Bool)0 [L783] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 2 y$flush_delayed = weak$$choice2 [L786] 2 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=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L787] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L787] 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) [L788] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L788] 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)) [L789] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L789] 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)) [L790] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L790] 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)) [L791] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L791] 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)) [L793] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L793] 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)) [L794] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L795] 2 y = y$flush_delayed ? y$mem_tmp : y [L796] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L799] 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=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L799] 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) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L739] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L801] 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 [L740] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L741] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L742] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L830] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, 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] [L831] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L832] 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 [L833] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L834] 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 [L837] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L838] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L839] 0 y$flush_delayed = weak$$choice2 [L840] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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] [L841] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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] [L841] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L842] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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] [L842] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L843] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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] [L843] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L844] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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] [L844] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L845] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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] [L845] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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] [L846] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L847] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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] [L847] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L848] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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, 238 locations, 2 error locations. Result: UNSAFE, OverallTime: 57.4s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 18.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5865 SDtfs, 5882 SDslu, 21670 SDs, 0 SdLazy, 8507 SolverSat, 322 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 289 GetRequests, 48 SyntacticMatches, 29 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126190occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 18278 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 1810 NumberOfCodeBlocks, 1810 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1690 ConstructedInterpolants, 0 QuantifiedInterpolants, 643320 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...