/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix000_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 15:26:54,667 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 15:26:54,670 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 15:26:54,686 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 15:26:54,686 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 15:26:54,687 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 15:26:54,688 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 15:26:54,690 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 15:26:54,692 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 15:26:54,693 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 15:26:54,694 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 15:26:54,695 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 15:26:54,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 15:26:54,696 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 15:26:54,697 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 15:26:54,698 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 15:26:54,699 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 15:26:54,700 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 15:26:54,701 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 15:26:54,704 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 15:26:54,706 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 15:26:54,707 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 15:26:54,711 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 15:26:54,712 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 15:26:54,719 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 15:26:54,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 15:26:54,719 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 15:26:54,720 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 15:26:54,721 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 15:26:54,724 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 15:26:54,725 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 15:26:54,725 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 15:26:54,726 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 15:26:54,727 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 15:26:54,728 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 15:26:54,728 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 15:26:54,729 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 15:26:54,730 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 15:26:54,730 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 15:26:54,734 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 15:26:54,736 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 15:26:54,736 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 15:26:54,763 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 15:26:54,763 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 15:26:54,766 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 15:26:54,766 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 15:26:54,766 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 15:26:54,766 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 15:26:54,766 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 15:26:54,767 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 15:26:54,767 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 15:26:54,767 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 15:26:54,768 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 15:26:54,769 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 15:26:54,769 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 15:26:54,769 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 15:26:54,769 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 15:26:54,770 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 15:26:54,770 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 15:26:54,770 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 15:26:54,770 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 15:26:54,770 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 15:26:54,771 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 15:26:54,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:26:54,771 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 15:26:54,772 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 15:26:54,772 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 15:26:54,772 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 15:26:54,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 15:26:54,772 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 15:26:54,772 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 15:26:54,773 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 15:26:54,774 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 15:26:55,068 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 15:26:55,081 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 15:26:55,084 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 15:26:55,086 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 15:26:55,086 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 15:26:55,087 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000_power.opt.i [2019-12-27 15:26:55,145 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68c17f2fb/6751d80edcf34086b593b2f13d773ca9/FLAG74ac5fd29 [2019-12-27 15:26:55,682 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 15:26:55,682 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000_power.opt.i [2019-12-27 15:26:55,716 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68c17f2fb/6751d80edcf34086b593b2f13d773ca9/FLAG74ac5fd29 [2019-12-27 15:26:55,933 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68c17f2fb/6751d80edcf34086b593b2f13d773ca9 [2019-12-27 15:26:55,944 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 15:26:55,946 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 15:26:55,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 15:26:55,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 15:26:55,951 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 15:26:55,952 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:26:55" (1/1) ... [2019-12-27 15:26:55,955 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cb8ab56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:26:55, skipping insertion in model container [2019-12-27 15:26:55,955 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:26:55" (1/1) ... [2019-12-27 15:26:55,963 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 15:26:56,009 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 15:26:56,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:26:56,586 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 15:26:56,671 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:26:56,750 INFO L208 MainTranslator]: Completed translation [2019-12-27 15:26:56,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:26:56 WrapperNode [2019-12-27 15:26:56,751 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 15:26:56,752 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 15:26:56,752 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 15:26:56,752 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 15:26:56,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:26:56" (1/1) ... [2019-12-27 15:26:56,782 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:26:56" (1/1) ... [2019-12-27 15:26:56,815 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 15:26:56,815 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 15:26:56,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 15:26:56,815 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 15:26:56,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:26:56" (1/1) ... [2019-12-27 15:26:56,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:26:56" (1/1) ... [2019-12-27 15:26:56,830 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:26:56" (1/1) ... [2019-12-27 15:26:56,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:26:56" (1/1) ... [2019-12-27 15:26:56,842 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:26:56" (1/1) ... [2019-12-27 15:26:56,847 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:26:56" (1/1) ... [2019-12-27 15:26:56,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:26:56" (1/1) ... [2019-12-27 15:26:56,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 15:26:56,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 15:26:56,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 15:26:56,857 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 15:26:56,858 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:26:56" (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-27 15:26:56,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 15:26:56,923 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 15:26:56,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 15:26:56,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 15:26:56,924 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 15:26:56,924 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 15:26:56,924 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 15:26:56,924 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 15:26:56,925 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 15:26:56,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 15:26:56,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 15:26:56,927 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 15:26:57,753 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 15:26:57,753 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 15:26:57,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:26:57 BoogieIcfgContainer [2019-12-27 15:26:57,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 15:26:57,756 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 15:26:57,756 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 15:26:57,759 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 15:26:57,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:26:55" (1/3) ... [2019-12-27 15:26:57,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77c5a503 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:26:57, skipping insertion in model container [2019-12-27 15:26:57,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:26:56" (2/3) ... [2019-12-27 15:26:57,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77c5a503 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:26:57, skipping insertion in model container [2019-12-27 15:26:57,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:26:57" (3/3) ... [2019-12-27 15:26:57,763 INFO L109 eAbstractionObserver]: Analyzing ICFG mix000_power.opt.i [2019-12-27 15:26:57,773 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 15:26:57,774 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 15:26:57,781 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 15:26:57,782 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 15:26:57,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,839 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,840 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,861 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,861 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,862 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,862 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,862 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,890 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,891 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,899 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,900 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,902 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:26:57,920 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 15:26:57,943 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:26:57,943 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:26:57,943 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:26:57,943 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:26:57,943 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:26:57,944 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:26:57,944 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:26:57,944 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:26:57,968 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 228 transitions [2019-12-27 15:26:57,970 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-27 15:26:58,101 INFO L132 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-27 15:26:58,101 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:26:58,119 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 551 event pairs. 0/168 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-27 15:26:58,148 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-27 15:26:58,207 INFO L132 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-27 15:26:58,207 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:26:58,217 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 551 event pairs. 0/168 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-27 15:26:58,242 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-27 15:26:58,243 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:27:02,998 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-27 15:27:03,436 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 15:27:03,548 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 15:27:03,597 INFO L206 etLargeBlockEncoding]: Checked pairs total: 123043 [2019-12-27 15:27:03,597 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-27 15:27:03,601 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 104 places, 128 transitions [2019-12-27 15:27:04,999 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 23592 states. [2019-12-27 15:27:05,001 INFO L276 IsEmpty]: Start isEmpty. Operand 23592 states. [2019-12-27 15:27:05,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 15:27:05,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:05,007 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 15:27:05,007 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:05,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:05,012 INFO L82 PathProgramCache]: Analyzing trace with hash 962357028, now seen corresponding path program 1 times [2019-12-27 15:27:05,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:05,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784804867] [2019-12-27 15:27:05,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:05,260 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-27 15:27:05,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784804867] [2019-12-27 15:27:05,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:05,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:27:05,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1352529929] [2019-12-27 15:27:05,263 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:05,268 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:05,281 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 15:27:05,282 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:05,285 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:27:05,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:27:05,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:05,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:27:05,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:27:05,298 INFO L87 Difference]: Start difference. First operand 23592 states. Second operand 3 states. [2019-12-27 15:27:05,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:05,714 INFO L93 Difference]: Finished difference Result 23438 states and 83922 transitions. [2019-12-27 15:27:05,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:27:05,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 15:27:05,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:05,907 INFO L225 Difference]: With dead ends: 23438 [2019-12-27 15:27:05,907 INFO L226 Difference]: Without dead ends: 21828 [2019-12-27 15:27:05,909 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-27 15:27:07,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21828 states. [2019-12-27 15:27:07,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21828 to 21828. [2019-12-27 15:27:07,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21828 states. [2019-12-27 15:27:08,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21828 states to 21828 states and 78096 transitions. [2019-12-27 15:27:08,099 INFO L78 Accepts]: Start accepts. Automaton has 21828 states and 78096 transitions. Word has length 5 [2019-12-27 15:27:08,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:08,099 INFO L462 AbstractCegarLoop]: Abstraction has 21828 states and 78096 transitions. [2019-12-27 15:27:08,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:27:08,100 INFO L276 IsEmpty]: Start isEmpty. Operand 21828 states and 78096 transitions. [2019-12-27 15:27:08,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 15:27:08,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:08,103 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:27:08,104 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:08,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:08,104 INFO L82 PathProgramCache]: Analyzing trace with hash -549370662, now seen corresponding path program 1 times [2019-12-27 15:27:08,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:08,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162291227] [2019-12-27 15:27:08,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:08,198 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-27 15:27:08,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162291227] [2019-12-27 15:27:08,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:08,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:27:08,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1223517676] [2019-12-27 15:27:08,202 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:08,203 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:08,208 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 15:27:08,208 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:08,208 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:27:08,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:27:08,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:08,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:27:08,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:27:08,216 INFO L87 Difference]: Start difference. First operand 21828 states and 78096 transitions. Second operand 4 states. [2019-12-27 15:27:08,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:08,761 INFO L93 Difference]: Finished difference Result 34804 states and 119015 transitions. [2019-12-27 15:27:08,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:27:08,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 15:27:08,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:08,898 INFO L225 Difference]: With dead ends: 34804 [2019-12-27 15:27:08,898 INFO L226 Difference]: Without dead ends: 34788 [2019-12-27 15:27:08,899 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-27 15:27:10,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34788 states. [2019-12-27 15:27:11,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34788 to 33965. [2019-12-27 15:27:11,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33965 states. [2019-12-27 15:27:11,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33965 states to 33965 states and 116837 transitions. [2019-12-27 15:27:11,370 INFO L78 Accepts]: Start accepts. Automaton has 33965 states and 116837 transitions. Word has length 11 [2019-12-27 15:27:11,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:11,370 INFO L462 AbstractCegarLoop]: Abstraction has 33965 states and 116837 transitions. [2019-12-27 15:27:11,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:27:11,370 INFO L276 IsEmpty]: Start isEmpty. Operand 33965 states and 116837 transitions. [2019-12-27 15:27:11,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 15:27:11,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:11,375 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:27:11,375 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:11,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:11,376 INFO L82 PathProgramCache]: Analyzing trace with hash -779218677, now seen corresponding path program 1 times [2019-12-27 15:27:11,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:11,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242793991] [2019-12-27 15:27:11,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:11,478 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-27 15:27:11,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242793991] [2019-12-27 15:27:11,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:11,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:27:11,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [204738259] [2019-12-27 15:27:11,480 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:11,481 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:11,486 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 15:27:11,486 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:11,530 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:27:11,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:27:11,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:11,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:27:11,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:27:11,531 INFO L87 Difference]: Start difference. First operand 33965 states and 116837 transitions. Second operand 5 states. [2019-12-27 15:27:12,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:12,012 INFO L93 Difference]: Finished difference Result 44062 states and 148933 transitions. [2019-12-27 15:27:12,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:27:12,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 15:27:12,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:12,177 INFO L225 Difference]: With dead ends: 44062 [2019-12-27 15:27:12,177 INFO L226 Difference]: Without dead ends: 44047 [2019-12-27 15:27:12,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:27:12,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44047 states. [2019-12-27 15:27:13,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44047 to 39221. [2019-12-27 15:27:13,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39221 states. [2019-12-27 15:27:15,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39221 states to 39221 states and 134004 transitions. [2019-12-27 15:27:15,927 INFO L78 Accepts]: Start accepts. Automaton has 39221 states and 134004 transitions. Word has length 14 [2019-12-27 15:27:15,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:15,929 INFO L462 AbstractCegarLoop]: Abstraction has 39221 states and 134004 transitions. [2019-12-27 15:27:15,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:27:15,929 INFO L276 IsEmpty]: Start isEmpty. Operand 39221 states and 134004 transitions. [2019-12-27 15:27:15,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 15:27:15,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:15,933 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:27:15,933 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:15,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:15,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1614053436, now seen corresponding path program 1 times [2019-12-27 15:27:15,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:15,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413994718] [2019-12-27 15:27:15,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:15,983 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-27 15:27:15,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413994718] [2019-12-27 15:27:15,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:15,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:27:15,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [209473798] [2019-12-27 15:27:15,986 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:15,988 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:15,992 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 55 transitions. [2019-12-27 15:27:15,992 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:16,023 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:27:16,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:27:16,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:16,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:27:16,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:27:16,024 INFO L87 Difference]: Start difference. First operand 39221 states and 134004 transitions. Second operand 5 states. [2019-12-27 15:27:16,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:16,365 INFO L93 Difference]: Finished difference Result 64200 states and 209661 transitions. [2019-12-27 15:27:16,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:27:16,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-27 15:27:16,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:16,513 INFO L225 Difference]: With dead ends: 64200 [2019-12-27 15:27:16,513 INFO L226 Difference]: Without dead ends: 64200 [2019-12-27 15:27:16,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:27:17,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64200 states. [2019-12-27 15:27:18,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64200 to 57180. [2019-12-27 15:27:18,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57180 states. [2019-12-27 15:27:18,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57180 states to 57180 states and 189699 transitions. [2019-12-27 15:27:18,641 INFO L78 Accepts]: Start accepts. Automaton has 57180 states and 189699 transitions. Word has length 15 [2019-12-27 15:27:18,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:18,641 INFO L462 AbstractCegarLoop]: Abstraction has 57180 states and 189699 transitions. [2019-12-27 15:27:18,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:27:18,642 INFO L276 IsEmpty]: Start isEmpty. Operand 57180 states and 189699 transitions. [2019-12-27 15:27:18,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 15:27:18,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:18,647 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:27:18,647 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:18,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:18,648 INFO L82 PathProgramCache]: Analyzing trace with hash -223387027, now seen corresponding path program 1 times [2019-12-27 15:27:18,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:18,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497026400] [2019-12-27 15:27:18,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:18,696 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-27 15:27:18,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497026400] [2019-12-27 15:27:18,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:18,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:27:18,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1691806364] [2019-12-27 15:27:18,698 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:18,699 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:18,701 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 15:27:18,701 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:18,701 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:27:18,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:27:18,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:18,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:27:18,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:27:18,703 INFO L87 Difference]: Start difference. First operand 57180 states and 189699 transitions. Second operand 3 states. [2019-12-27 15:27:19,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:19,009 INFO L93 Difference]: Finished difference Result 53778 states and 178159 transitions. [2019-12-27 15:27:19,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:27:19,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 15:27:19,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:19,178 INFO L225 Difference]: With dead ends: 53778 [2019-12-27 15:27:19,178 INFO L226 Difference]: Without dead ends: 53778 [2019-12-27 15:27:19,178 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-27 15:27:20,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53778 states. [2019-12-27 15:27:20,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53778 to 53778. [2019-12-27 15:27:20,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53778 states. [2019-12-27 15:27:21,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53778 states to 53778 states and 178159 transitions. [2019-12-27 15:27:21,495 INFO L78 Accepts]: Start accepts. Automaton has 53778 states and 178159 transitions. Word has length 16 [2019-12-27 15:27:21,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:21,496 INFO L462 AbstractCegarLoop]: Abstraction has 53778 states and 178159 transitions. [2019-12-27 15:27:21,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:27:21,496 INFO L276 IsEmpty]: Start isEmpty. Operand 53778 states and 178159 transitions. [2019-12-27 15:27:21,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 15:27:21,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:21,501 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:27:21,502 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:21,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:21,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1852908680, now seen corresponding path program 1 times [2019-12-27 15:27:21,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:21,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700538440] [2019-12-27 15:27:21,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:21,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-27 15:27:21,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700538440] [2019-12-27 15:27:21,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:21,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:27:21,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [811372471] [2019-12-27 15:27:21,582 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:21,585 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:21,592 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 65 transitions. [2019-12-27 15:27:21,592 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:21,610 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:27:21,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:27:21,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:21,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:27:21,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:27:21,615 INFO L87 Difference]: Start difference. First operand 53778 states and 178159 transitions. Second operand 5 states. [2019-12-27 15:27:22,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:22,192 INFO L93 Difference]: Finished difference Result 66740 states and 217759 transitions. [2019-12-27 15:27:22,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:27:22,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 15:27:22,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:22,322 INFO L225 Difference]: With dead ends: 66740 [2019-12-27 15:27:22,323 INFO L226 Difference]: Without dead ends: 66723 [2019-12-27 15:27:22,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:27:22,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66723 states. [2019-12-27 15:27:25,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66723 to 54524. [2019-12-27 15:27:25,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54524 states. [2019-12-27 15:27:25,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54524 states to 54524 states and 180597 transitions. [2019-12-27 15:27:25,696 INFO L78 Accepts]: Start accepts. Automaton has 54524 states and 180597 transitions. Word has length 17 [2019-12-27 15:27:25,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:25,697 INFO L462 AbstractCegarLoop]: Abstraction has 54524 states and 180597 transitions. [2019-12-27 15:27:25,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:27:25,697 INFO L276 IsEmpty]: Start isEmpty. Operand 54524 states and 180597 transitions. [2019-12-27 15:27:25,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 15:27:25,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:25,710 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:27:25,710 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:25,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:25,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1536984533, now seen corresponding path program 1 times [2019-12-27 15:27:25,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:25,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142250765] [2019-12-27 15:27:25,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:26,082 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-27 15:27:26,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142250765] [2019-12-27 15:27:26,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:26,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:27:26,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1952502593] [2019-12-27 15:27:26,083 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:26,086 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:26,095 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 70 transitions. [2019-12-27 15:27:26,095 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:26,096 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:27:26,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:27:26,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:26,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:27:26,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:27:26,097 INFO L87 Difference]: Start difference. First operand 54524 states and 180597 transitions. Second operand 5 states. [2019-12-27 15:27:27,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:27,042 INFO L93 Difference]: Finished difference Result 77321 states and 249603 transitions. [2019-12-27 15:27:27,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 15:27:27,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-27 15:27:27,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:27,196 INFO L225 Difference]: With dead ends: 77321 [2019-12-27 15:27:27,196 INFO L226 Difference]: Without dead ends: 77307 [2019-12-27 15:27:27,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:27:27,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77307 states. [2019-12-27 15:27:30,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77307 to 59256. [2019-12-27 15:27:30,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59256 states. [2019-12-27 15:27:30,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59256 states to 59256 states and 195309 transitions. [2019-12-27 15:27:30,482 INFO L78 Accepts]: Start accepts. Automaton has 59256 states and 195309 transitions. Word has length 20 [2019-12-27 15:27:30,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:30,482 INFO L462 AbstractCegarLoop]: Abstraction has 59256 states and 195309 transitions. [2019-12-27 15:27:30,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:27:30,482 INFO L276 IsEmpty]: Start isEmpty. Operand 59256 states and 195309 transitions. [2019-12-27 15:27:30,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 15:27:30,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:30,499 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:27:30,499 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:30,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:30,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1507310190, now seen corresponding path program 1 times [2019-12-27 15:27:30,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:30,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768007685] [2019-12-27 15:27:30,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:30,560 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-27 15:27:30,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768007685] [2019-12-27 15:27:30,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:30,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:27:30,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1292619339] [2019-12-27 15:27:30,561 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:30,564 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:30,571 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 55 transitions. [2019-12-27 15:27:30,571 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:30,630 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:27:30,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:27:30,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:30,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:27:30,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:27:30,631 INFO L87 Difference]: Start difference. First operand 59256 states and 195309 transitions. Second operand 6 states. [2019-12-27 15:27:31,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:31,298 INFO L93 Difference]: Finished difference Result 14540 states and 39017 transitions. [2019-12-27 15:27:31,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:27:31,299 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-12-27 15:27:31,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:31,311 INFO L225 Difference]: With dead ends: 14540 [2019-12-27 15:27:31,311 INFO L226 Difference]: Without dead ends: 8809 [2019-12-27 15:27:31,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:27:31,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8809 states. [2019-12-27 15:27:31,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8809 to 7851. [2019-12-27 15:27:31,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7851 states. [2019-12-27 15:27:31,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7851 states to 7851 states and 18282 transitions. [2019-12-27 15:27:31,754 INFO L78 Accepts]: Start accepts. Automaton has 7851 states and 18282 transitions. Word has length 23 [2019-12-27 15:27:31,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:31,754 INFO L462 AbstractCegarLoop]: Abstraction has 7851 states and 18282 transitions. [2019-12-27 15:27:31,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:27:31,754 INFO L276 IsEmpty]: Start isEmpty. Operand 7851 states and 18282 transitions. [2019-12-27 15:27:31,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 15:27:31,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:31,760 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:27:31,760 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:31,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:31,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1044355322, now seen corresponding path program 1 times [2019-12-27 15:27:31,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:31,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554267503] [2019-12-27 15:27:31,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:31,843 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-27 15:27:31,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554267503] [2019-12-27 15:27:31,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:31,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:27:31,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1879741903] [2019-12-27 15:27:31,844 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:31,849 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:31,871 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 111 transitions. [2019-12-27 15:27:31,871 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:31,901 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:27:31,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:27:31,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:31,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:27:31,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:27:31,902 INFO L87 Difference]: Start difference. First operand 7851 states and 18282 transitions. Second operand 5 states. [2019-12-27 15:27:32,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:32,021 INFO L93 Difference]: Finished difference Result 8411 states and 18464 transitions. [2019-12-27 15:27:32,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:27:32,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-27 15:27:32,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:32,033 INFO L225 Difference]: With dead ends: 8411 [2019-12-27 15:27:32,034 INFO L226 Difference]: Without dead ends: 8411 [2019-12-27 15:27:32,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:27:32,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8411 states. [2019-12-27 15:27:32,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8411 to 7884. [2019-12-27 15:27:32,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7884 states. [2019-12-27 15:27:32,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7884 states to 7884 states and 17367 transitions. [2019-12-27 15:27:32,177 INFO L78 Accepts]: Start accepts. Automaton has 7884 states and 17367 transitions. Word has length 31 [2019-12-27 15:27:32,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:32,180 INFO L462 AbstractCegarLoop]: Abstraction has 7884 states and 17367 transitions. [2019-12-27 15:27:32,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:27:32,180 INFO L276 IsEmpty]: Start isEmpty. Operand 7884 states and 17367 transitions. [2019-12-27 15:27:32,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 15:27:32,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:32,191 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-27 15:27:32,191 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:32,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:32,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1333269799, now seen corresponding path program 1 times [2019-12-27 15:27:32,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:32,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885142346] [2019-12-27 15:27:32,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:32,286 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-27 15:27:32,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885142346] [2019-12-27 15:27:32,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:32,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:27:32,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1266870088] [2019-12-27 15:27:32,288 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:32,293 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:32,316 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 81 states and 126 transitions. [2019-12-27 15:27:32,316 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:32,339 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:27:32,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:27:32,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:32,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:27:32,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:27:32,341 INFO L87 Difference]: Start difference. First operand 7884 states and 17367 transitions. Second operand 6 states. [2019-12-27 15:27:32,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:32,822 INFO L93 Difference]: Finished difference Result 8767 states and 19048 transitions. [2019-12-27 15:27:32,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:27:32,823 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-27 15:27:32,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:32,833 INFO L225 Difference]: With dead ends: 8767 [2019-12-27 15:27:32,833 INFO L226 Difference]: Without dead ends: 8766 [2019-12-27 15:27:32,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:27:32,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8766 states. [2019-12-27 15:27:32,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8766 to 7045. [2019-12-27 15:27:32,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7045 states. [2019-12-27 15:27:32,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7045 states to 7045 states and 15671 transitions. [2019-12-27 15:27:32,908 INFO L78 Accepts]: Start accepts. Automaton has 7045 states and 15671 transitions. Word has length 34 [2019-12-27 15:27:32,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:32,908 INFO L462 AbstractCegarLoop]: Abstraction has 7045 states and 15671 transitions. [2019-12-27 15:27:32,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:27:32,908 INFO L276 IsEmpty]: Start isEmpty. Operand 7045 states and 15671 transitions. [2019-12-27 15:27:32,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 15:27:32,916 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:32,916 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:27:32,916 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:32,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:32,916 INFO L82 PathProgramCache]: Analyzing trace with hash 135630366, now seen corresponding path program 1 times [2019-12-27 15:27:32,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:32,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920961177] [2019-12-27 15:27:32,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:32,980 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-27 15:27:32,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920961177] [2019-12-27 15:27:32,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:32,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:27:32,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2034945833] [2019-12-27 15:27:32,981 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:32,989 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:33,001 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 41 transitions. [2019-12-27 15:27:33,002 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:33,002 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:27:33,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:27:33,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:33,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:27:33,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:27:33,003 INFO L87 Difference]: Start difference. First operand 7045 states and 15671 transitions. Second operand 5 states. [2019-12-27 15:27:33,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:33,115 INFO L93 Difference]: Finished difference Result 10568 states and 23583 transitions. [2019-12-27 15:27:33,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 15:27:33,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-27 15:27:33,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:33,125 INFO L225 Difference]: With dead ends: 10568 [2019-12-27 15:27:33,125 INFO L226 Difference]: Without dead ends: 8470 [2019-12-27 15:27:33,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:27:33,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8470 states. [2019-12-27 15:27:33,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8470 to 8470. [2019-12-27 15:27:33,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8470 states. [2019-12-27 15:27:33,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8470 states to 8470 states and 18937 transitions. [2019-12-27 15:27:33,219 INFO L78 Accepts]: Start accepts. Automaton has 8470 states and 18937 transitions. Word has length 41 [2019-12-27 15:27:33,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:33,220 INFO L462 AbstractCegarLoop]: Abstraction has 8470 states and 18937 transitions. [2019-12-27 15:27:33,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:27:33,220 INFO L276 IsEmpty]: Start isEmpty. Operand 8470 states and 18937 transitions. [2019-12-27 15:27:33,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 15:27:33,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:33,230 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] [2019-12-27 15:27:33,231 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:33,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:33,231 INFO L82 PathProgramCache]: Analyzing trace with hash -584274922, now seen corresponding path program 1 times [2019-12-27 15:27:33,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:33,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642750537] [2019-12-27 15:27:33,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:33,298 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-27 15:27:33,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642750537] [2019-12-27 15:27:33,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:33,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:27:33,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1009643690] [2019-12-27 15:27:33,301 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:33,310 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:33,324 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 43 states and 42 transitions. [2019-12-27 15:27:33,324 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:33,325 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:27:33,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:27:33,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:33,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:27:33,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:27:33,327 INFO L87 Difference]: Start difference. First operand 8470 states and 18937 transitions. Second operand 3 states. [2019-12-27 15:27:33,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:33,363 INFO L93 Difference]: Finished difference Result 8469 states and 18935 transitions. [2019-12-27 15:27:33,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:27:33,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-27 15:27:33,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:33,378 INFO L225 Difference]: With dead ends: 8469 [2019-12-27 15:27:33,378 INFO L226 Difference]: Without dead ends: 8469 [2019-12-27 15:27:33,378 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-27 15:27:33,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8469 states. [2019-12-27 15:27:33,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8469 to 8469. [2019-12-27 15:27:33,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8469 states. [2019-12-27 15:27:33,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8469 states to 8469 states and 18935 transitions. [2019-12-27 15:27:33,519 INFO L78 Accepts]: Start accepts. Automaton has 8469 states and 18935 transitions. Word has length 42 [2019-12-27 15:27:33,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:33,519 INFO L462 AbstractCegarLoop]: Abstraction has 8469 states and 18935 transitions. [2019-12-27 15:27:33,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:27:33,520 INFO L276 IsEmpty]: Start isEmpty. Operand 8469 states and 18935 transitions. [2019-12-27 15:27:33,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 15:27:33,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:33,533 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] [2019-12-27 15:27:33,533 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:33,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:33,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1281753600, now seen corresponding path program 1 times [2019-12-27 15:27:33,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:33,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4198375] [2019-12-27 15:27:33,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:33,599 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-27 15:27:33,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4198375] [2019-12-27 15:27:33,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:33,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:27:33,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1888013169] [2019-12-27 15:27:33,601 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:33,609 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:33,626 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 52 transitions. [2019-12-27 15:27:33,627 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:33,640 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:27:33,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:27:33,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:33,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:27:33,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:27:33,643 INFO L87 Difference]: Start difference. First operand 8469 states and 18935 transitions. Second operand 5 states. [2019-12-27 15:27:33,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:33,689 INFO L93 Difference]: Finished difference Result 9674 states and 21550 transitions. [2019-12-27 15:27:33,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:27:33,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-27 15:27:33,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:33,700 INFO L225 Difference]: With dead ends: 9674 [2019-12-27 15:27:33,700 INFO L226 Difference]: Without dead ends: 7389 [2019-12-27 15:27:33,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:27:33,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7389 states. [2019-12-27 15:27:34,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7389 to 7369. [2019-12-27 15:27:34,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7369 states. [2019-12-27 15:27:34,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7369 states to 7369 states and 16445 transitions. [2019-12-27 15:27:34,389 INFO L78 Accepts]: Start accepts. Automaton has 7369 states and 16445 transitions. Word has length 43 [2019-12-27 15:27:34,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:34,389 INFO L462 AbstractCegarLoop]: Abstraction has 7369 states and 16445 transitions. [2019-12-27 15:27:34,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:27:34,389 INFO L276 IsEmpty]: Start isEmpty. Operand 7369 states and 16445 transitions. [2019-12-27 15:27:34,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 15:27:34,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:34,398 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] [2019-12-27 15:27:34,398 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:34,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:34,398 INFO L82 PathProgramCache]: Analyzing trace with hash -93592056, now seen corresponding path program 2 times [2019-12-27 15:27:34,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:34,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804659821] [2019-12-27 15:27:34,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:34,481 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-27 15:27:34,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804659821] [2019-12-27 15:27:34,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:34,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 15:27:34,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [981680844] [2019-12-27 15:27:34,482 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:34,491 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:34,511 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 53 states and 61 transitions. [2019-12-27 15:27:34,511 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:34,512 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:27:34,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:27:34,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:34,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:27:34,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:27:34,515 INFO L87 Difference]: Start difference. First operand 7369 states and 16445 transitions. Second operand 5 states. [2019-12-27 15:27:34,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:34,956 INFO L93 Difference]: Finished difference Result 8101 states and 17927 transitions. [2019-12-27 15:27:34,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 15:27:34,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-27 15:27:34,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:34,966 INFO L225 Difference]: With dead ends: 8101 [2019-12-27 15:27:34,966 INFO L226 Difference]: Without dead ends: 8101 [2019-12-27 15:27:34,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:27:34,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8101 states. [2019-12-27 15:27:35,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8101 to 7907. [2019-12-27 15:27:35,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7907 states. [2019-12-27 15:27:35,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7907 states to 7907 states and 17557 transitions. [2019-12-27 15:27:35,054 INFO L78 Accepts]: Start accepts. Automaton has 7907 states and 17557 transitions. Word has length 43 [2019-12-27 15:27:35,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:35,054 INFO L462 AbstractCegarLoop]: Abstraction has 7907 states and 17557 transitions. [2019-12-27 15:27:35,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:27:35,054 INFO L276 IsEmpty]: Start isEmpty. Operand 7907 states and 17557 transitions. [2019-12-27 15:27:35,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 15:27:35,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:35,064 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:27:35,064 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:35,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:35,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1410522453, now seen corresponding path program 1 times [2019-12-27 15:27:35,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:35,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367100726] [2019-12-27 15:27:35,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:35,146 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-27 15:27:35,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367100726] [2019-12-27 15:27:35,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:35,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:27:35,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1936421550] [2019-12-27 15:27:35,148 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:35,157 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:35,180 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 55 states and 64 transitions. [2019-12-27 15:27:35,180 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:35,183 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 15:27:35,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:27:35,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:35,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:27:35,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:27:35,184 INFO L87 Difference]: Start difference. First operand 7907 states and 17557 transitions. Second operand 5 states. [2019-12-27 15:27:35,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:35,247 INFO L93 Difference]: Finished difference Result 5915 states and 13053 transitions. [2019-12-27 15:27:35,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:27:35,247 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-27 15:27:35,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:35,249 INFO L225 Difference]: With dead ends: 5915 [2019-12-27 15:27:35,249 INFO L226 Difference]: Without dead ends: 1013 [2019-12-27 15:27:35,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:27:35,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2019-12-27 15:27:35,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 971. [2019-12-27 15:27:35,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 971 states. [2019-12-27 15:27:35,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1954 transitions. [2019-12-27 15:27:35,262 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1954 transitions. Word has length 44 [2019-12-27 15:27:35,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:35,263 INFO L462 AbstractCegarLoop]: Abstraction has 971 states and 1954 transitions. [2019-12-27 15:27:35,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:27:35,263 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1954 transitions. [2019-12-27 15:27:35,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 15:27:35,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:35,265 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] [2019-12-27 15:27:35,265 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:35,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:35,266 INFO L82 PathProgramCache]: Analyzing trace with hash -743639945, now seen corresponding path program 1 times [2019-12-27 15:27:35,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:35,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335929221] [2019-12-27 15:27:35,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:35,376 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-27 15:27:35,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335929221] [2019-12-27 15:27:35,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:35,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 15:27:35,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1158423549] [2019-12-27 15:27:35,379 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:35,402 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:35,488 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 102 states and 143 transitions. [2019-12-27 15:27:35,488 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:35,542 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 15:27:35,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 15:27:35,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:35,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 15:27:35,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:27:35,543 INFO L87 Difference]: Start difference. First operand 971 states and 1954 transitions. Second operand 8 states. [2019-12-27 15:27:35,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:35,768 INFO L93 Difference]: Finished difference Result 1747 states and 3498 transitions. [2019-12-27 15:27:35,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 15:27:35,768 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-12-27 15:27:35,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:35,770 INFO L225 Difference]: With dead ends: 1747 [2019-12-27 15:27:35,770 INFO L226 Difference]: Without dead ends: 1278 [2019-12-27 15:27:35,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-27 15:27:35,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2019-12-27 15:27:35,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 1036. [2019-12-27 15:27:35,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2019-12-27 15:27:35,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 2064 transitions. [2019-12-27 15:27:35,788 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 2064 transitions. Word has length 59 [2019-12-27 15:27:35,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:35,789 INFO L462 AbstractCegarLoop]: Abstraction has 1036 states and 2064 transitions. [2019-12-27 15:27:35,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 15:27:35,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 2064 transitions. [2019-12-27 15:27:35,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 15:27:35,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:35,791 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] [2019-12-27 15:27:35,791 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:35,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:35,791 INFO L82 PathProgramCache]: Analyzing trace with hash 681597047, now seen corresponding path program 2 times [2019-12-27 15:27:35,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:35,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703131562] [2019-12-27 15:27:35,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:35,885 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-27 15:27:35,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703131562] [2019-12-27 15:27:35,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:35,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:27:35,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [700602153] [2019-12-27 15:27:35,886 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:35,917 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:36,018 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 117 states and 168 transitions. [2019-12-27 15:27:36,018 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:36,051 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 15:27:36,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:27:36,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:36,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:27:36,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:27:36,052 INFO L87 Difference]: Start difference. First operand 1036 states and 2064 transitions. Second operand 6 states. [2019-12-27 15:27:36,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:36,512 INFO L93 Difference]: Finished difference Result 1162 states and 2290 transitions. [2019-12-27 15:27:36,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:27:36,512 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-27 15:27:36,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:36,514 INFO L225 Difference]: With dead ends: 1162 [2019-12-27 15:27:36,514 INFO L226 Difference]: Without dead ends: 1162 [2019-12-27 15:27:36,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 15:27:36,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2019-12-27 15:27:36,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1066. [2019-12-27 15:27:36,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1066 states. [2019-12-27 15:27:36,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 2119 transitions. [2019-12-27 15:27:36,526 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 2119 transitions. Word has length 59 [2019-12-27 15:27:36,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:36,527 INFO L462 AbstractCegarLoop]: Abstraction has 1066 states and 2119 transitions. [2019-12-27 15:27:36,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:27:36,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 2119 transitions. [2019-12-27 15:27:36,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 15:27:36,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:36,528 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] [2019-12-27 15:27:36,528 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:36,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:36,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1965459209, now seen corresponding path program 3 times [2019-12-27 15:27:36,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:36,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189946916] [2019-12-27 15:27:36,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:27:36,593 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-27 15:27:36,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189946916] [2019-12-27 15:27:36,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:27:36,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:27:36,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1330470496] [2019-12-27 15:27:36,596 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:27:36,611 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:27:36,728 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 107 transitions. [2019-12-27 15:27:36,728 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:27:36,728 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:27:36,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:27:36,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:27:36,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:27:36,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:27:36,733 INFO L87 Difference]: Start difference. First operand 1066 states and 2119 transitions. Second operand 3 states. [2019-12-27 15:27:36,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:27:36,755 INFO L93 Difference]: Finished difference Result 1066 states and 2118 transitions. [2019-12-27 15:27:36,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:27:36,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 15:27:36,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:27:36,757 INFO L225 Difference]: With dead ends: 1066 [2019-12-27 15:27:36,757 INFO L226 Difference]: Without dead ends: 1066 [2019-12-27 15:27:36,757 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-27 15:27:36,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2019-12-27 15:27:36,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 930. [2019-12-27 15:27:36,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2019-12-27 15:27:36,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1870 transitions. [2019-12-27 15:27:36,770 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1870 transitions. Word has length 59 [2019-12-27 15:27:36,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:27:36,771 INFO L462 AbstractCegarLoop]: Abstraction has 930 states and 1870 transitions. [2019-12-27 15:27:36,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:27:36,771 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1870 transitions. [2019-12-27 15:27:36,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 15:27:36,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:27:36,773 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:27:36,773 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:27:36,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:27:36,773 INFO L82 PathProgramCache]: Analyzing trace with hash -328419130, now seen corresponding path program 1 times [2019-12-27 15:27:36,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:27:36,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401083230] [2019-12-27 15:27:36,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:27:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:27:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:27:36,903 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:27:36,903 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:27:36,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd1~0_264 0) (= 0 v_~x$w_buff0~0_204) (= v_~main$tmp_guard1~0_44 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t0~0.base_34| 4)) (= v_~__unbuffered_p1_EBX~0_50 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t0~0.base_34|) (= 0 v_~weak$$choice0~0_151) (= 0 v_~x$mem_tmp~0_161) (= (select .cse0 |v_ULTIMATE.start_main_~#t0~0.base_34|) 0) (= 0 v_~x$w_buff1~0_194) (= v_~__unbuffered_p0_EBX~0_54 0) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~x$w_buff1_used~0_447) (= 0 v_~x$w_buff0_used~0_844) (= 0 v_~x$r_buff1_thd2~0_308) (= v_~y~0_47 0) (= 0 v_~x~0_246) (= v_~x$r_buff1_thd0~0_211 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_p0_EAX~0_71) (< 0 |v_#StackHeapBarrier_14|) (= v_~x$flush_delayed~0_185 0) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p1_EAX~0_69) (= |v_#NULL.offset_4| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t0~0.base_34| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t0~0.base_34|) |v_ULTIMATE.start_main_~#t0~0.offset_24| 0)) |v_#memory_int_17|) (= 0 v_~x$r_buff0_thd2~0_438) (= |v_ULTIMATE.start_main_~#t0~0.offset_24| 0) (= v_~weak$$choice2~0_232 0) (= 0 v_~x$r_buff0_thd0~0_98) (= (store .cse0 |v_ULTIMATE.start_main_~#t0~0.base_34| 1) |v_#valid_57|) (= v_~x$r_buff0_thd1~0_297 0) (= 0 v_~__unbuffered_cnt~0_47))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_204, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_297, ~x$flush_delayed~0=v_~x$flush_delayed~0_185, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_16|, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_264, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ~x$mem_tmp~0=v_~x$mem_tmp~0_161, ULTIMATE.start_main_~#t0~0.offset=|v_ULTIMATE.start_main_~#t0~0.offset_24|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_71, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_69, #length=|v_#length_19|, ~y~0=v_~y~0_47, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_98, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_50, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_194, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_132|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_97|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_447, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_308, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_153|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_211, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_438, ULTIMATE.start_main_~#t0~0.base=|v_ULTIMATE.start_main_~#t0~0.base_34|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_844, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_91|, ULTIMATE.start_main_~#t1~0.base=|v_ULTIMATE.start_main_~#t1~0.base_23|, ~weak$$choice0~0=v_~weak$$choice0~0_151, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_117|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_31|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_232, ULTIMATE.start_main_~#t1~0.offset=|v_ULTIMATE.start_main_~#t1~0.offset_18|, ~x~0=v_~x~0_246, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t0~0.offset, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t0~0.base, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_~#t1~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1~0.offset, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 15:27:36,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L813-1-->L815: Formula: (and (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1~0.base_12|) (= |v_ULTIMATE.start_main_~#t1~0.offset_10| 0) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0.base_12| 0)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1~0.base_12| 1)) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1~0.base_12|) |v_ULTIMATE.start_main_~#t1~0.offset_10| 1)) |v_#memory_int_7|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1~0.base=|v_ULTIMATE.start_main_~#t1~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1~0.offset=|v_ULTIMATE.start_main_~#t1~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1~0.offset] because there is no mapped edge [2019-12-27 15:27:36,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] P1ENTRY-->L5-3: Formula: (and (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| 1) (= 1 v_~x$w_buff0_used~0_158) (= |v_P1Thread1of1ForFork1_#in~arg.offset_8| v_P1Thread1of1ForFork1_~arg.offset_8) (= 1 v_~x$w_buff0~0_35) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_10) (= v_~x$w_buff1_used~0_84 v_~x$w_buff0_used~0_159) (= (mod v_~x$w_buff1_used~0_84 256) 0) (= v_P1Thread1of1ForFork1_~arg.base_8 |v_P1Thread1of1ForFork1_#in~arg.base_8|) (= v_~x$w_buff0~0_36 v_~x$w_buff1~0_51)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_36, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_159} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~x$w_buff0~0=v_~x$w_buff0~0_35, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_8, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_8|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_8, ~x$w_buff1~0=v_~x$w_buff1~0_51, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_84, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 15:27:36,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L775-2-->L775-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1862254629 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1862254629 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1~0_In-1862254629 |P1Thread1of1ForFork1_#t~ite28_Out-1862254629|)) (and (= ~x$w_buff0~0_In-1862254629 |P1Thread1of1ForFork1_#t~ite28_Out-1862254629|) (not .cse0) (not .cse1)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1862254629, ~x$w_buff1~0=~x$w_buff1~0_In-1862254629, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1862254629, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1862254629} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1862254629, ~x$w_buff1~0=~x$w_buff1~0_In-1862254629, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1862254629, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1862254629|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1862254629} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 15:27:36,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L775-4-->L776: Formula: (= v_~x~0_72 |v_P1Thread1of1ForFork1_#t~ite28_10|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_10|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_13|, ~x~0=v_~x~0_72, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~x~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 15:27:36,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L780-->L781: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_44 256))) (= v_~x$r_buff0_thd2~0_86 v_~x$r_buff0_thd2~0_85)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_86, ~weak$$choice2~0=v_~weak$$choice2~0_44} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_8|, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_11|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_11|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_44} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 15:27:36,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In-933424276 256) 0))) (or (and (= ~x$mem_tmp~0_In-933424276 |P1Thread1of1ForFork1_#t~ite48_Out-933424276|) (not .cse0)) (and .cse0 (= ~x~0_In-933424276 |P1Thread1of1ForFork1_#t~ite48_Out-933424276|)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-933424276, ~x$mem_tmp~0=~x$mem_tmp~0_In-933424276, ~x~0=~x~0_In-933424276} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In-933424276, ~x$mem_tmp~0=~x$mem_tmp~0_In-933424276, ~x~0=~x~0_In-933424276, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out-933424276|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-27 15:27:36,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L791-->L791-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In944370196 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In944370196 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite51_Out944370196| ~x$w_buff0_used~0_In944370196)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite51_Out944370196|) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In944370196, ~x$w_buff0_used~0=~x$w_buff0_used~0_In944370196} OutVars{P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out944370196|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In944370196, ~x$w_buff0_used~0=~x$w_buff0_used~0_In944370196} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-27 15:27:36,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L792-->L792-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1796480779 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-1796480779 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1796480779 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1796480779 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite52_Out-1796480779|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1796480779 |P1Thread1of1ForFork1_#t~ite52_Out-1796480779|) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1796480779, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1796480779, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1796480779, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1796480779} OutVars{P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out-1796480779|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1796480779, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1796480779, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1796480779, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1796480779} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-27 15:27:36,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L793-->L794: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1893404962 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-1893404962 256) 0))) (or (and (= ~x$r_buff0_thd2~0_Out-1893404962 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out-1893404962 ~x$r_buff0_thd2~0_In-1893404962)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1893404962, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1893404962} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-1893404962|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1893404962, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1893404962} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 15:27:36,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L794-->L794-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd2~0_In-1678925241 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-1678925241 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-1678925241 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1678925241 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In-1678925241 |P1Thread1of1ForFork1_#t~ite54_Out-1678925241|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite54_Out-1678925241|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1678925241, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1678925241, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1678925241, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1678925241} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1678925241, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1678925241, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-1678925241|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1678925241, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1678925241} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-27 15:27:36,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_117 |v_P1Thread1of1ForFork1_#t~ite54_20|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_20|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_117, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_19|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 15:27:36,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In-372915901 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite25_Out-372915901| ~x$mem_tmp~0_In-372915901)) (and .cse0 (= |P0Thread1of1ForFork0_#t~ite25_Out-372915901| ~x~0_In-372915901)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-372915901, ~x$mem_tmp~0=~x$mem_tmp~0_In-372915901, ~x~0=~x~0_In-372915901} OutVars{P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out-372915901|, ~x$flush_delayed~0=~x$flush_delayed~0_In-372915901, ~x$mem_tmp~0=~x$mem_tmp~0_In-372915901, ~x~0=~x~0_In-372915901} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-27 15:27:36,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L747-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_26 (+ v_~__unbuffered_cnt~0_27 1)) (= |v_P0Thread1of1ForFork0_#t~ite25_20| v_~x~0_123) (= v_~x$flush_delayed~0_78 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_19|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~x$flush_delayed~0=v_~x$flush_delayed~0_78, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~x~0=v_~x~0_123} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~x$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 15:27:36,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L819-->L821-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_30 256)) (= (mod v_~x$w_buff0_used~0_209 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 15:27:36,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [928] [928] L821-2-->L821-5: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-97913291 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-97913291 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite58_Out-97913291| |ULTIMATE.start_main_#t~ite57_Out-97913291|))) (or (and (not .cse0) .cse1 (= |ULTIMATE.start_main_#t~ite57_Out-97913291| ~x$w_buff1~0_In-97913291) (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite57_Out-97913291| ~x~0_In-97913291) (or .cse0 .cse2) .cse1))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-97913291, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-97913291, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-97913291, ~x~0=~x~0_In-97913291} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-97913291, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-97913291|, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-97913291|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-97913291, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-97913291, ~x~0=~x~0_In-97913291} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-27 15:27:36,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-2136451237 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-2136451237 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite59_Out-2136451237| ~x$w_buff0_used~0_In-2136451237)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite59_Out-2136451237|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2136451237, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2136451237} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2136451237, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-2136451237|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2136451237} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 15:27:36,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1544211442 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1544211442 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In1544211442 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1544211442 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite60_Out1544211442| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite60_Out1544211442| ~x$w_buff1_used~0_In1544211442)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1544211442, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1544211442, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1544211442, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1544211442} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1544211442, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1544211442|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1544211442, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1544211442, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1544211442} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-27 15:27:36,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [939] [939] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-2120193734 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2120193734 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-2120193734| 0)) (and (= |ULTIMATE.start_main_#t~ite61_Out-2120193734| ~x$r_buff0_thd0~0_In-2120193734) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2120193734, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2120193734} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2120193734, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-2120193734|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2120193734} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-27 15:27:36,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L825-->L825-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In266353677 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In266353677 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In266353677 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In266353677 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In266353677 |ULTIMATE.start_main_#t~ite62_Out266353677|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite62_Out266353677|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In266353677, ~x$w_buff1_used~0=~x$w_buff1_used~0_In266353677, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In266353677, ~x$w_buff0_used~0=~x$w_buff0_used~0_In266353677} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out266353677|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In266353677, ~x$w_buff1_used~0=~x$w_buff1_used~0_In266353677, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In266353677, ~x$w_buff0_used~0=~x$w_buff0_used~0_In266353677} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-27 15:27:36,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L825-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p0_EAX~0_51) (= v_~__unbuffered_p1_EBX~0_27 0) (= 1 v_~__unbuffered_p1_EAX~0_38) (= v_~__unbuffered_p0_EBX~0_31 0) (= v_~main$tmp_guard1~0_21 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_21 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~x$r_buff1_thd0~0_183 |v_ULTIMATE.start_main_#t~ite62_50|)) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_50|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_51, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_49|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_51, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 15:27:37,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:27:37 BasicIcfg [2019-12-27 15:27:37,077 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 15:27:37,080 INFO L168 Benchmark]: Toolchain (without parser) took 41133.24 ms. Allocated memory was 138.4 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 101.8 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 178.9 MB. Max. memory is 7.1 GB. [2019-12-27 15:27:37,080 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 15:27:37,081 INFO L168 Benchmark]: CACSL2BoogieTranslator took 804.54 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 101.3 MB in the beginning and 154.8 MB in the end (delta: -53.4 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-27 15:27:37,082 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.26 ms. Allocated memory is still 201.3 MB. Free memory was 154.8 MB in the beginning and 151.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-27 15:27:37,082 INFO L168 Benchmark]: Boogie Preprocessor took 41.72 ms. Allocated memory is still 201.3 MB. Free memory was 151.4 MB in the beginning and 149.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 15:27:37,083 INFO L168 Benchmark]: RCFGBuilder took 897.40 ms. Allocated memory is still 201.3 MB. Free memory was 148.8 MB in the beginning and 96.1 MB in the end (delta: 52.7 MB). Peak memory consumption was 52.7 MB. Max. memory is 7.1 GB. [2019-12-27 15:27:37,084 INFO L168 Benchmark]: TraceAbstraction took 39321.01 ms. Allocated memory was 201.3 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 96.1 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 110.3 MB. Max. memory is 7.1 GB. [2019-12-27 15:27:37,087 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 804.54 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 101.3 MB in the beginning and 154.8 MB in the end (delta: -53.4 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.26 ms. Allocated memory is still 201.3 MB. Free memory was 154.8 MB in the beginning and 151.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.72 ms. Allocated memory is still 201.3 MB. Free memory was 151.4 MB in the beginning and 149.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 897.40 ms. Allocated memory is still 201.3 MB. Free memory was 148.8 MB in the beginning and 96.1 MB in the end (delta: 52.7 MB). Peak memory consumption was 52.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 39321.01 ms. Allocated memory was 201.3 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 96.1 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 110.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 179 ProgramPointsBefore, 104 ProgramPointsAfterwards, 228 TransitionsBefore, 128 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 52 ConcurrentYvCompositions, 28 ChoiceCompositions, 9002 VarBasedMoverChecksPositive, 281 VarBasedMoverChecksNegative, 68 SemBasedMoverChecksPositive, 297 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 123043 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t0, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L815] FCALL, FORK 0 pthread_create(&t1, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 x$flush_delayed = weak$$choice2 [L774] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L775] 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L777] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L777] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L778] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L778] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L779] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L783] 2 x = x$flush_delayed ? x$mem_tmp : x [L784] 2 x$flush_delayed = (_Bool)0 [L787] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 1 y = 1 [L732] 1 __unbuffered_p0_EAX = y [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L744] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L745] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L821] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L822] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L823] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L824] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 173 locations, 2 error locations. Result: UNSAFE, OverallTime: 38.9s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3768 SDtfs, 3534 SDslu, 6496 SDs, 0 SdLazy, 2745 SolverSat, 197 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 43 SyntacticMatches, 10 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59256occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 21.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 46855 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 636 NumberOfCodeBlocks, 636 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 558 ConstructedInterpolants, 0 QuantifiedInterpolants, 62838 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...