/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 03:18:41,872 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 03:18:41,875 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 03:18:41,895 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 03:18:41,895 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 03:18:41,897 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 03:18:41,900 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 03:18:41,911 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 03:18:41,913 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 03:18:41,914 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 03:18:41,917 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 03:18:41,919 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 03:18:41,920 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 03:18:41,923 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 03:18:41,926 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 03:18:41,928 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 03:18:41,930 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 03:18:41,932 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 03:18:41,934 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 03:18:41,939 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 03:18:41,944 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 03:18:41,949 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 03:18:41,950 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 03:18:41,951 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 03:18:41,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 03:18:41,953 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 03:18:41,954 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 03:18:41,956 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 03:18:41,957 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 03:18:41,958 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 03:18:41,958 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 03:18:41,959 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 03:18:41,961 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 03:18:41,962 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 03:18:41,963 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 03:18:41,963 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 03:18:41,964 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 03:18:41,964 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 03:18:41,964 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 03:18:41,965 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 03:18:41,967 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 03:18:41,967 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-MCR.epf [2019-12-28 03:18:42,003 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 03:18:42,003 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 03:18:42,004 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 03:18:42,005 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 03:18:42,005 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 03:18:42,005 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 03:18:42,005 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 03:18:42,005 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 03:18:42,006 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 03:18:42,008 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 03:18:42,008 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 03:18:42,008 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 03:18:42,009 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 03:18:42,009 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 03:18:42,009 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 03:18:42,009 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 03:18:42,009 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 03:18:42,009 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 03:18:42,010 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 03:18:42,010 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 03:18:42,010 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 03:18:42,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 03:18:42,010 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 03:18:42,011 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 03:18:42,012 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 03:18:42,012 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 03:18:42,012 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 03:18:42,012 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 03:18:42,012 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 03:18:42,012 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 03:18:42,013 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 03:18:42,013 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 03:18:42,327 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 03:18:42,340 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 03:18:42,343 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 03:18:42,345 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 03:18:42,345 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 03:18:42,346 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_power.opt.i [2019-12-28 03:18:42,410 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/164949db0/2216e6506385466397d2459948886d70/FLAG0e7657e13 [2019-12-28 03:18:43,028 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 03:18:43,032 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_power.opt.i [2019-12-28 03:18:43,054 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/164949db0/2216e6506385466397d2459948886d70/FLAG0e7657e13 [2019-12-28 03:18:43,252 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/164949db0/2216e6506385466397d2459948886d70 [2019-12-28 03:18:43,264 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 03:18:43,266 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 03:18:43,271 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 03:18:43,271 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 03:18:43,275 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 03:18:43,276 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:18:43" (1/1) ... [2019-12-28 03:18:43,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e50f93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:43, skipping insertion in model container [2019-12-28 03:18:43,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:18:43" (1/1) ... [2019-12-28 03:18:43,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 03:18:43,338 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 03:18:43,837 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 03:18:43,852 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 03:18:43,974 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 03:18:44,048 INFO L208 MainTranslator]: Completed translation [2019-12-28 03:18:44,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:44 WrapperNode [2019-12-28 03:18:44,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 03:18:44,049 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 03:18:44,049 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 03:18:44,049 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 03:18:44,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:44" (1/1) ... [2019-12-28 03:18:44,078 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:44" (1/1) ... [2019-12-28 03:18:44,115 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 03:18:44,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 03:18:44,116 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 03:18:44,116 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 03:18:44,126 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:44" (1/1) ... [2019-12-28 03:18:44,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:44" (1/1) ... [2019-12-28 03:18:44,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:44" (1/1) ... [2019-12-28 03:18:44,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:44" (1/1) ... [2019-12-28 03:18:44,150 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:44" (1/1) ... [2019-12-28 03:18:44,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:44" (1/1) ... [2019-12-28 03:18:44,166 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:44" (1/1) ... [2019-12-28 03:18:44,174 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 03:18:44,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 03:18:44,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 03:18:44,178 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 03:18:44,182 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 03:18:44,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 03:18:44,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 03:18:44,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 03:18:44,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 03:18:44,251 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 03:18:44,251 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 03:18:44,251 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 03:18:44,251 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 03:18:44,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 03:18:44,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 03:18:44,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 03:18:44,254 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-28 03:18:44,978 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 03:18:44,979 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 03:18:44,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:18:44 BoogieIcfgContainer [2019-12-28 03:18:44,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 03:18:44,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 03:18:44,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 03:18:44,985 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 03:18:44,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 03:18:43" (1/3) ... [2019-12-28 03:18:44,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5809f5e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:18:44, skipping insertion in model container [2019-12-28 03:18:44,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:44" (2/3) ... [2019-12-28 03:18:44,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5809f5e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:18:44, skipping insertion in model container [2019-12-28 03:18:44,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:18:44" (3/3) ... [2019-12-28 03:18:44,990 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_power.opt.i [2019-12-28 03:18:45,001 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 03:18:45,002 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 03:18:45,010 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 03:18:45,011 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 03:18:45,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,053 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,053 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,053 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,054 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,054 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,069 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,069 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,141 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,142 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,142 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,148 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,151 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:45,167 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 03:18:45,188 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 03:18:45,189 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 03:18:45,189 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 03:18:45,189 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 03:18:45,189 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 03:18:45,189 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 03:18:45,189 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 03:18:45,190 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 03:18:45,204 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146 places, 180 transitions [2019-12-28 03:18:47,353 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32590 states. [2019-12-28 03:18:47,355 INFO L276 IsEmpty]: Start isEmpty. Operand 32590 states. [2019-12-28 03:18:47,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-28 03:18:47,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:18:47,363 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:18:47,363 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:18:47,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:18:47,369 INFO L82 PathProgramCache]: Analyzing trace with hash -334571497, now seen corresponding path program 1 times [2019-12-28 03:18:47,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:18:47,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945892247] [2019-12-28 03:18:47,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:18:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:18:47,637 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-28 03:18:47,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945892247] [2019-12-28 03:18:47,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:18:47,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:18:47,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [198302996] [2019-12-28 03:18:47,641 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:18:47,651 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:18:47,670 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 33 transitions. [2019-12-28 03:18:47,671 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:18:47,675 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:18:47,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:18:47,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:18:47,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:18:47,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:18:47,691 INFO L87 Difference]: Start difference. First operand 32590 states. Second operand 4 states. [2019-12-28 03:18:49,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:18:49,304 INFO L93 Difference]: Finished difference Result 33590 states and 129567 transitions. [2019-12-28 03:18:49,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:18:49,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-28 03:18:49,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:18:49,596 INFO L225 Difference]: With dead ends: 33590 [2019-12-28 03:18:49,596 INFO L226 Difference]: Without dead ends: 25702 [2019-12-28 03:18:49,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:18:50,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2019-12-28 03:18:50,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 25702. [2019-12-28 03:18:50,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25702 states. [2019-12-28 03:18:51,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25702 states to 25702 states and 99583 transitions. [2019-12-28 03:18:51,471 INFO L78 Accepts]: Start accepts. Automaton has 25702 states and 99583 transitions. Word has length 33 [2019-12-28 03:18:51,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:18:51,472 INFO L462 AbstractCegarLoop]: Abstraction has 25702 states and 99583 transitions. [2019-12-28 03:18:51,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:18:51,472 INFO L276 IsEmpty]: Start isEmpty. Operand 25702 states and 99583 transitions. [2019-12-28 03:18:51,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-28 03:18:51,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:18:51,483 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] [2019-12-28 03:18:51,484 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:18:51,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:18:51,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1021806200, now seen corresponding path program 1 times [2019-12-28 03:18:51,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:18:51,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009199932] [2019-12-28 03:18:51,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:18:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:18:51,685 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-28 03:18:51,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009199932] [2019-12-28 03:18:51,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:18:51,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:18:51,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1057919579] [2019-12-28 03:18:51,686 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:18:51,691 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:18:51,699 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 45 transitions. [2019-12-28 03:18:51,699 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:18:51,699 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:18:51,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:18:51,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:18:51,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:18:51,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:18:51,702 INFO L87 Difference]: Start difference. First operand 25702 states and 99583 transitions. Second operand 5 states. [2019-12-28 03:18:52,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:18:52,633 INFO L93 Difference]: Finished difference Result 41080 states and 150430 transitions. [2019-12-28 03:18:52,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:18:52,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-28 03:18:52,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:18:54,245 INFO L225 Difference]: With dead ends: 41080 [2019-12-28 03:18:54,245 INFO L226 Difference]: Without dead ends: 40544 [2019-12-28 03:18:54,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:18:54,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40544 states. [2019-12-28 03:18:55,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40544 to 38924. [2019-12-28 03:18:55,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38924 states. [2019-12-28 03:18:55,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38924 states to 38924 states and 143580 transitions. [2019-12-28 03:18:55,826 INFO L78 Accepts]: Start accepts. Automaton has 38924 states and 143580 transitions. Word has length 45 [2019-12-28 03:18:55,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:18:55,828 INFO L462 AbstractCegarLoop]: Abstraction has 38924 states and 143580 transitions. [2019-12-28 03:18:55,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:18:55,828 INFO L276 IsEmpty]: Start isEmpty. Operand 38924 states and 143580 transitions. [2019-12-28 03:18:55,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-28 03:18:55,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:18:55,834 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] [2019-12-28 03:18:55,835 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:18:55,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:18:55,835 INFO L82 PathProgramCache]: Analyzing trace with hash -169129071, now seen corresponding path program 1 times [2019-12-28 03:18:55,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:18:55,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714278906] [2019-12-28 03:18:55,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:18:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:18:55,914 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-28 03:18:55,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714278906] [2019-12-28 03:18:55,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:18:55,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:18:55,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [810986795] [2019-12-28 03:18:55,916 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:18:55,921 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:18:55,927 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 47 states and 46 transitions. [2019-12-28 03:18:55,927 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:18:55,927 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:18:55,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:18:55,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:18:55,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:18:55,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:18:55,929 INFO L87 Difference]: Start difference. First operand 38924 states and 143580 transitions. Second operand 5 states. [2019-12-28 03:18:56,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:18:56,840 INFO L93 Difference]: Finished difference Result 49777 states and 180632 transitions. [2019-12-28 03:18:56,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:18:56,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-28 03:18:56,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:18:57,151 INFO L225 Difference]: With dead ends: 49777 [2019-12-28 03:18:57,152 INFO L226 Difference]: Without dead ends: 49273 [2019-12-28 03:18:57,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:18:57,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49273 states. [2019-12-28 03:18:59,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49273 to 42676. [2019-12-28 03:18:59,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42676 states. [2019-12-28 03:19:00,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42676 states to 42676 states and 156591 transitions. [2019-12-28 03:19:00,075 INFO L78 Accepts]: Start accepts. Automaton has 42676 states and 156591 transitions. Word has length 46 [2019-12-28 03:19:00,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:00,075 INFO L462 AbstractCegarLoop]: Abstraction has 42676 states and 156591 transitions. [2019-12-28 03:19:00,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:19:00,075 INFO L276 IsEmpty]: Start isEmpty. Operand 42676 states and 156591 transitions. [2019-12-28 03:19:00,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-28 03:19:00,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:00,084 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:00,084 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:00,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:00,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1646950391, now seen corresponding path program 1 times [2019-12-28 03:19:00,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:00,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691100252] [2019-12-28 03:19:00,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:00,137 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-28 03:19:00,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691100252] [2019-12-28 03:19:00,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:00,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:19:00,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [781705934] [2019-12-28 03:19:00,139 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:00,145 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:00,150 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 48 transitions. [2019-12-28 03:19:00,151 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:00,152 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:00,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:19:00,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:00,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:19:00,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:19:00,153 INFO L87 Difference]: Start difference. First operand 42676 states and 156591 transitions. Second operand 3 states. [2019-12-28 03:19:00,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:00,829 INFO L93 Difference]: Finished difference Result 61086 states and 221429 transitions. [2019-12-28 03:19:00,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:19:00,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-12-28 03:19:00,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:01,021 INFO L225 Difference]: With dead ends: 61086 [2019-12-28 03:19:01,022 INFO L226 Difference]: Without dead ends: 61086 [2019-12-28 03:19:01,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:19:01,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61086 states. [2019-12-28 03:19:03,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61086 to 48015. [2019-12-28 03:19:03,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48015 states. [2019-12-28 03:19:03,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48015 states to 48015 states and 174178 transitions. [2019-12-28 03:19:03,936 INFO L78 Accepts]: Start accepts. Automaton has 48015 states and 174178 transitions. Word has length 48 [2019-12-28 03:19:03,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:03,936 INFO L462 AbstractCegarLoop]: Abstraction has 48015 states and 174178 transitions. [2019-12-28 03:19:03,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:19:03,936 INFO L276 IsEmpty]: Start isEmpty. Operand 48015 states and 174178 transitions. [2019-12-28 03:19:03,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-28 03:19:03,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:03,952 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:03,952 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:03,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:03,953 INFO L82 PathProgramCache]: Analyzing trace with hash 2087627749, now seen corresponding path program 1 times [2019-12-28 03:19:03,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:03,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867733655] [2019-12-28 03:19:03,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:04,131 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-28 03:19:04,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867733655] [2019-12-28 03:19:04,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:04,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:19:04,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1427893147] [2019-12-28 03:19:04,132 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:04,140 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:04,146 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 64 transitions. [2019-12-28 03:19:04,146 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:04,149 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:04,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:19:04,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:04,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:19:04,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:19:04,151 INFO L87 Difference]: Start difference. First operand 48015 states and 174178 transitions. Second operand 6 states. [2019-12-28 03:19:05,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:05,112 INFO L93 Difference]: Finished difference Result 63755 states and 229378 transitions. [2019-12-28 03:19:05,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:19:05,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-28 03:19:05,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:05,722 INFO L225 Difference]: With dead ends: 63755 [2019-12-28 03:19:05,722 INFO L226 Difference]: Without dead ends: 63755 [2019-12-28 03:19:05,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:19:06,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63755 states. [2019-12-28 03:19:09,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63755 to 59948. [2019-12-28 03:19:09,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59948 states. [2019-12-28 03:19:09,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59948 states to 59948 states and 215671 transitions. [2019-12-28 03:19:09,438 INFO L78 Accepts]: Start accepts. Automaton has 59948 states and 215671 transitions. Word has length 52 [2019-12-28 03:19:09,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:09,438 INFO L462 AbstractCegarLoop]: Abstraction has 59948 states and 215671 transitions. [2019-12-28 03:19:09,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:19:09,438 INFO L276 IsEmpty]: Start isEmpty. Operand 59948 states and 215671 transitions. [2019-12-28 03:19:09,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-28 03:19:09,458 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:09,458 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:09,459 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:09,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:09,459 INFO L82 PathProgramCache]: Analyzing trace with hash 290676390, now seen corresponding path program 1 times [2019-12-28 03:19:09,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:09,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917906425] [2019-12-28 03:19:09,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:09,568 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-28 03:19:09,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917906425] [2019-12-28 03:19:09,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:09,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:19:09,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1480815679] [2019-12-28 03:19:09,569 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:09,575 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:09,581 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 64 transitions. [2019-12-28 03:19:09,582 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:09,582 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:09,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:19:09,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:09,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:19:09,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:19:09,584 INFO L87 Difference]: Start difference. First operand 59948 states and 215671 transitions. Second operand 7 states. [2019-12-28 03:19:11,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:11,012 INFO L93 Difference]: Finished difference Result 83684 states and 290096 transitions. [2019-12-28 03:19:11,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 03:19:11,012 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-28 03:19:11,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:11,194 INFO L225 Difference]: With dead ends: 83684 [2019-12-28 03:19:11,195 INFO L226 Difference]: Without dead ends: 83684 [2019-12-28 03:19:11,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-28 03:19:11,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83684 states. [2019-12-28 03:19:12,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83684 to 71011. [2019-12-28 03:19:12,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71011 states. [2019-12-28 03:19:12,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71011 states to 71011 states and 249885 transitions. [2019-12-28 03:19:12,999 INFO L78 Accepts]: Start accepts. Automaton has 71011 states and 249885 transitions. Word has length 52 [2019-12-28 03:19:12,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:13,496 INFO L462 AbstractCegarLoop]: Abstraction has 71011 states and 249885 transitions. [2019-12-28 03:19:13,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:19:13,497 INFO L276 IsEmpty]: Start isEmpty. Operand 71011 states and 249885 transitions. [2019-12-28 03:19:13,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-28 03:19:13,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:13,513 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:13,513 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:13,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:13,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1178180071, now seen corresponding path program 1 times [2019-12-28 03:19:13,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:13,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033899798] [2019-12-28 03:19:13,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:13,596 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-28 03:19:13,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033899798] [2019-12-28 03:19:13,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:13,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:19:13,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [758217153] [2019-12-28 03:19:13,599 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:13,605 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:13,612 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 64 transitions. [2019-12-28 03:19:13,612 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:13,613 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:13,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:19:13,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:13,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:19:13,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:19:13,615 INFO L87 Difference]: Start difference. First operand 71011 states and 249885 transitions. Second operand 3 states. [2019-12-28 03:19:13,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:13,868 INFO L93 Difference]: Finished difference Result 54020 states and 188917 transitions. [2019-12-28 03:19:13,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:19:13,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-28 03:19:13,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:13,982 INFO L225 Difference]: With dead ends: 54020 [2019-12-28 03:19:13,982 INFO L226 Difference]: Without dead ends: 54020 [2019-12-28 03:19:13,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:19:14,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54020 states. [2019-12-28 03:19:14,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54020 to 53405. [2019-12-28 03:19:14,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53405 states. [2019-12-28 03:19:17,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53405 states to 53405 states and 187036 transitions. [2019-12-28 03:19:17,950 INFO L78 Accepts]: Start accepts. Automaton has 53405 states and 187036 transitions. Word has length 52 [2019-12-28 03:19:17,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:17,950 INFO L462 AbstractCegarLoop]: Abstraction has 53405 states and 187036 transitions. [2019-12-28 03:19:17,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:19:17,951 INFO L276 IsEmpty]: Start isEmpty. Operand 53405 states and 187036 transitions. [2019-12-28 03:19:17,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-28 03:19:17,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:17,960 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:17,960 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:17,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:17,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1257036994, now seen corresponding path program 1 times [2019-12-28 03:19:17,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:17,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931363804] [2019-12-28 03:19:17,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:18,037 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-28 03:19:18,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931363804] [2019-12-28 03:19:18,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:18,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:19:18,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2114123247] [2019-12-28 03:19:18,038 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:18,046 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:18,053 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 53 states and 52 transitions. [2019-12-28 03:19:18,053 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:18,053 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:18,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:19:18,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:18,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:19:18,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:19:18,054 INFO L87 Difference]: Start difference. First operand 53405 states and 187036 transitions. Second operand 6 states. [2019-12-28 03:19:18,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:18,800 INFO L93 Difference]: Finished difference Result 68645 states and 237300 transitions. [2019-12-28 03:19:18,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 03:19:18,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-28 03:19:18,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:18,942 INFO L225 Difference]: With dead ends: 68645 [2019-12-28 03:19:18,942 INFO L226 Difference]: Without dead ends: 68077 [2019-12-28 03:19:18,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-28 03:19:19,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68077 states. [2019-12-28 03:19:20,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68077 to 53489. [2019-12-28 03:19:20,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53489 states. [2019-12-28 03:19:20,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53489 states to 53489 states and 187733 transitions. [2019-12-28 03:19:20,281 INFO L78 Accepts]: Start accepts. Automaton has 53489 states and 187733 transitions. Word has length 52 [2019-12-28 03:19:20,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:20,281 INFO L462 AbstractCegarLoop]: Abstraction has 53489 states and 187733 transitions. [2019-12-28 03:19:20,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:19:20,281 INFO L276 IsEmpty]: Start isEmpty. Operand 53489 states and 187733 transitions. [2019-12-28 03:19:20,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-28 03:19:20,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:20,294 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] [2019-12-28 03:19:20,294 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:20,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:20,294 INFO L82 PathProgramCache]: Analyzing trace with hash -2126518202, now seen corresponding path program 1 times [2019-12-28 03:19:20,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:20,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167595127] [2019-12-28 03:19:20,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:20,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:20,437 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-28 03:19:20,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167595127] [2019-12-28 03:19:20,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:20,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:19:20,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1459813212] [2019-12-28 03:19:20,439 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:20,445 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:20,451 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 54 states and 53 transitions. [2019-12-28 03:19:20,452 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:20,452 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:20,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:19:20,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:20,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:19:20,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:19:20,454 INFO L87 Difference]: Start difference. First operand 53489 states and 187733 transitions. Second operand 6 states. [2019-12-28 03:19:21,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:21,307 INFO L93 Difference]: Finished difference Result 67848 states and 231359 transitions. [2019-12-28 03:19:21,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:19:21,307 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-28 03:19:21,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:21,462 INFO L225 Difference]: With dead ends: 67848 [2019-12-28 03:19:21,462 INFO L226 Difference]: Without dead ends: 67848 [2019-12-28 03:19:21,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:19:21,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67848 states. [2019-12-28 03:19:22,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67848 to 59080. [2019-12-28 03:19:22,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59080 states. [2019-12-28 03:19:23,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59080 states to 59080 states and 204129 transitions. [2019-12-28 03:19:23,055 INFO L78 Accepts]: Start accepts. Automaton has 59080 states and 204129 transitions. Word has length 53 [2019-12-28 03:19:23,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:23,055 INFO L462 AbstractCegarLoop]: Abstraction has 59080 states and 204129 transitions. [2019-12-28 03:19:23,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:19:23,055 INFO L276 IsEmpty]: Start isEmpty. Operand 59080 states and 204129 transitions. [2019-12-28 03:19:23,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-28 03:19:23,065 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:23,065 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:23,066 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:23,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:23,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1239014521, now seen corresponding path program 1 times [2019-12-28 03:19:23,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:23,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330491472] [2019-12-28 03:19:23,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:23,134 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-28 03:19:23,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330491472] [2019-12-28 03:19:23,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:23,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:19:23,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1361452235] [2019-12-28 03:19:23,135 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:23,140 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:23,145 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 54 states and 53 transitions. [2019-12-28 03:19:23,145 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:23,146 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:23,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:19:23,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:23,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:19:23,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:19:23,147 INFO L87 Difference]: Start difference. First operand 59080 states and 204129 transitions. Second operand 4 states. [2019-12-28 03:19:23,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:23,210 INFO L93 Difference]: Finished difference Result 10211 states and 31245 transitions. [2019-12-28 03:19:23,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:19:23,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-28 03:19:23,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:23,224 INFO L225 Difference]: With dead ends: 10211 [2019-12-28 03:19:23,224 INFO L226 Difference]: Without dead ends: 8506 [2019-12-28 03:19:23,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:19:23,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8506 states. [2019-12-28 03:19:23,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8506 to 8458. [2019-12-28 03:19:23,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8458 states. [2019-12-28 03:19:23,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8458 states to 8458 states and 25324 transitions. [2019-12-28 03:19:23,331 INFO L78 Accepts]: Start accepts. Automaton has 8458 states and 25324 transitions. Word has length 53 [2019-12-28 03:19:23,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:23,331 INFO L462 AbstractCegarLoop]: Abstraction has 8458 states and 25324 transitions. [2019-12-28 03:19:23,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:19:23,331 INFO L276 IsEmpty]: Start isEmpty. Operand 8458 states and 25324 transitions. [2019-12-28 03:19:23,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-28 03:19:23,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:23,334 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-28 03:19:23,334 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:23,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:23,335 INFO L82 PathProgramCache]: Analyzing trace with hash -575967074, now seen corresponding path program 1 times [2019-12-28 03:19:23,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:23,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072440431] [2019-12-28 03:19:23,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:23,375 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-28 03:19:23,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072440431] [2019-12-28 03:19:23,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:23,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:19:23,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1215022554] [2019-12-28 03:19:23,376 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:23,385 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:23,395 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 60 transitions. [2019-12-28 03:19:23,395 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:23,395 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:23,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:19:23,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:23,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:19:23,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:19:23,396 INFO L87 Difference]: Start difference. First operand 8458 states and 25324 transitions. Second operand 4 states. [2019-12-28 03:19:23,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:23,500 INFO L93 Difference]: Finished difference Result 9705 states and 29103 transitions. [2019-12-28 03:19:23,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:19:23,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-12-28 03:19:23,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:23,517 INFO L225 Difference]: With dead ends: 9705 [2019-12-28 03:19:23,518 INFO L226 Difference]: Without dead ends: 9705 [2019-12-28 03:19:23,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:19:23,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9705 states. [2019-12-28 03:19:23,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9705 to 8878. [2019-12-28 03:19:23,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8878 states. [2019-12-28 03:19:23,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8878 states to 8878 states and 26587 transitions. [2019-12-28 03:19:23,643 INFO L78 Accepts]: Start accepts. Automaton has 8878 states and 26587 transitions. Word has length 60 [2019-12-28 03:19:23,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:23,644 INFO L462 AbstractCegarLoop]: Abstraction has 8878 states and 26587 transitions. [2019-12-28 03:19:23,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:19:23,644 INFO L276 IsEmpty]: Start isEmpty. Operand 8878 states and 26587 transitions. [2019-12-28 03:19:23,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-28 03:19:23,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:23,647 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-28 03:19:23,647 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:23,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:23,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1166843261, now seen corresponding path program 1 times [2019-12-28 03:19:23,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:23,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122518772] [2019-12-28 03:19:23,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:23,707 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-28 03:19:23,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122518772] [2019-12-28 03:19:23,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:23,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:19:23,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [249058397] [2019-12-28 03:19:23,708 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:23,716 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:23,726 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 60 transitions. [2019-12-28 03:19:23,726 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:23,727 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:23,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:19:23,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:23,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:19:23,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:19:23,728 INFO L87 Difference]: Start difference. First operand 8878 states and 26587 transitions. Second operand 6 states. [2019-12-28 03:19:24,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:24,068 INFO L93 Difference]: Finished difference Result 11194 states and 33074 transitions. [2019-12-28 03:19:24,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 03:19:24,069 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-28 03:19:24,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:24,084 INFO L225 Difference]: With dead ends: 11194 [2019-12-28 03:19:24,084 INFO L226 Difference]: Without dead ends: 11133 [2019-12-28 03:19:24,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-28 03:19:24,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11133 states. [2019-12-28 03:19:24,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11133 to 10409. [2019-12-28 03:19:24,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10409 states. [2019-12-28 03:19:24,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10409 states to 10409 states and 30941 transitions. [2019-12-28 03:19:24,212 INFO L78 Accepts]: Start accepts. Automaton has 10409 states and 30941 transitions. Word has length 60 [2019-12-28 03:19:24,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:24,212 INFO L462 AbstractCegarLoop]: Abstraction has 10409 states and 30941 transitions. [2019-12-28 03:19:24,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:19:24,212 INFO L276 IsEmpty]: Start isEmpty. Operand 10409 states and 30941 transitions. [2019-12-28 03:19:24,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 03:19:24,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:24,217 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:24,217 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:24,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:24,218 INFO L82 PathProgramCache]: Analyzing trace with hash -45860868, now seen corresponding path program 1 times [2019-12-28 03:19:24,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:24,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386036764] [2019-12-28 03:19:24,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:24,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:24,289 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-28 03:19:24,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386036764] [2019-12-28 03:19:24,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:24,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:19:24,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1538180537] [2019-12-28 03:19:24,290 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:24,300 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:24,452 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 119 states and 170 transitions. [2019-12-28 03:19:24,453 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:24,453 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:24,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:19:24,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:24,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:19:24,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:19:24,454 INFO L87 Difference]: Start difference. First operand 10409 states and 30941 transitions. Second operand 4 states. [2019-12-28 03:19:24,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:24,753 INFO L93 Difference]: Finished difference Result 13382 states and 39332 transitions. [2019-12-28 03:19:24,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:19:24,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-28 03:19:24,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:24,772 INFO L225 Difference]: With dead ends: 13382 [2019-12-28 03:19:24,772 INFO L226 Difference]: Without dead ends: 13382 [2019-12-28 03:19:24,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:19:24,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13382 states. [2019-12-28 03:19:24,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13382 to 11723. [2019-12-28 03:19:24,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11723 states. [2019-12-28 03:19:24,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11723 states to 11723 states and 34576 transitions. [2019-12-28 03:19:24,926 INFO L78 Accepts]: Start accepts. Automaton has 11723 states and 34576 transitions. Word has length 66 [2019-12-28 03:19:24,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:24,927 INFO L462 AbstractCegarLoop]: Abstraction has 11723 states and 34576 transitions. [2019-12-28 03:19:24,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:19:24,927 INFO L276 IsEmpty]: Start isEmpty. Operand 11723 states and 34576 transitions. [2019-12-28 03:19:24,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 03:19:24,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:24,934 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:24,934 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:24,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:24,934 INFO L82 PathProgramCache]: Analyzing trace with hash 915753149, now seen corresponding path program 1 times [2019-12-28 03:19:24,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:24,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139490606] [2019-12-28 03:19:24,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:25,043 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-28 03:19:25,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139490606] [2019-12-28 03:19:25,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:25,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:19:25,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1002812729] [2019-12-28 03:19:25,044 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:25,054 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:25,077 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 119 states and 170 transitions. [2019-12-28 03:19:25,077 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:25,078 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:25,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:19:25,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:25,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:19:25,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:19:25,079 INFO L87 Difference]: Start difference. First operand 11723 states and 34576 transitions. Second operand 6 states. [2019-12-28 03:19:25,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:25,648 INFO L93 Difference]: Finished difference Result 12872 states and 37333 transitions. [2019-12-28 03:19:25,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:19:25,649 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-28 03:19:25,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:25,667 INFO L225 Difference]: With dead ends: 12872 [2019-12-28 03:19:25,667 INFO L226 Difference]: Without dead ends: 12872 [2019-12-28 03:19:25,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:19:25,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12872 states. [2019-12-28 03:19:25,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12872 to 12572. [2019-12-28 03:19:25,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12572 states. [2019-12-28 03:19:25,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12572 states to 12572 states and 36575 transitions. [2019-12-28 03:19:25,828 INFO L78 Accepts]: Start accepts. Automaton has 12572 states and 36575 transitions. Word has length 66 [2019-12-28 03:19:25,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:25,829 INFO L462 AbstractCegarLoop]: Abstraction has 12572 states and 36575 transitions. [2019-12-28 03:19:25,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:19:25,829 INFO L276 IsEmpty]: Start isEmpty. Operand 12572 states and 36575 transitions. [2019-12-28 03:19:25,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 03:19:25,836 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:25,836 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:25,837 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:25,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:25,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1608854846, now seen corresponding path program 1 times [2019-12-28 03:19:25,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:25,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671507433] [2019-12-28 03:19:25,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:25,922 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-28 03:19:25,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671507433] [2019-12-28 03:19:25,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:25,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:19:25,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1141726722] [2019-12-28 03:19:25,923 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:25,933 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:25,959 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 119 states and 170 transitions. [2019-12-28 03:19:25,959 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:25,960 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:25,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:19:25,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:25,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:19:25,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:19:25,961 INFO L87 Difference]: Start difference. First operand 12572 states and 36575 transitions. Second operand 6 states. [2019-12-28 03:19:26,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:26,446 INFO L93 Difference]: Finished difference Result 14461 states and 40823 transitions. [2019-12-28 03:19:26,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 03:19:26,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-28 03:19:26,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:26,466 INFO L225 Difference]: With dead ends: 14461 [2019-12-28 03:19:26,466 INFO L226 Difference]: Without dead ends: 14461 [2019-12-28 03:19:26,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:19:26,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14461 states. [2019-12-28 03:19:26,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14461 to 13135. [2019-12-28 03:19:26,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13135 states. [2019-12-28 03:19:26,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13135 states to 13135 states and 37544 transitions. [2019-12-28 03:19:26,629 INFO L78 Accepts]: Start accepts. Automaton has 13135 states and 37544 transitions. Word has length 66 [2019-12-28 03:19:26,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:26,629 INFO L462 AbstractCegarLoop]: Abstraction has 13135 states and 37544 transitions. [2019-12-28 03:19:26,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:19:26,630 INFO L276 IsEmpty]: Start isEmpty. Operand 13135 states and 37544 transitions. [2019-12-28 03:19:26,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 03:19:26,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:26,637 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:26,637 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:26,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:26,638 INFO L82 PathProgramCache]: Analyzing trace with hash -468354497, now seen corresponding path program 1 times [2019-12-28 03:19:26,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:26,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98432592] [2019-12-28 03:19:26,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:26,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:19:26,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98432592] [2019-12-28 03:19:26,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:26,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:19:26,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1600518908] [2019-12-28 03:19:26,727 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:26,738 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:26,762 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 119 states and 170 transitions. [2019-12-28 03:19:26,762 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:26,763 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:26,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:19:26,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:26,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:19:26,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:19:26,764 INFO L87 Difference]: Start difference. First operand 13135 states and 37544 transitions. Second operand 5 states. [2019-12-28 03:19:27,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:27,159 INFO L93 Difference]: Finished difference Result 16961 states and 48256 transitions. [2019-12-28 03:19:27,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 03:19:27,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-28 03:19:27,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:27,181 INFO L225 Difference]: With dead ends: 16961 [2019-12-28 03:19:27,181 INFO L226 Difference]: Without dead ends: 16961 [2019-12-28 03:19:27,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:19:27,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16961 states. [2019-12-28 03:19:27,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16961 to 15665. [2019-12-28 03:19:27,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15665 states. [2019-12-28 03:19:27,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15665 states to 15665 states and 44441 transitions. [2019-12-28 03:19:27,368 INFO L78 Accepts]: Start accepts. Automaton has 15665 states and 44441 transitions. Word has length 66 [2019-12-28 03:19:27,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:27,368 INFO L462 AbstractCegarLoop]: Abstraction has 15665 states and 44441 transitions. [2019-12-28 03:19:27,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:19:27,368 INFO L276 IsEmpty]: Start isEmpty. Operand 15665 states and 44441 transitions. [2019-12-28 03:19:27,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 03:19:27,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:27,378 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:27,378 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:27,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:27,378 INFO L82 PathProgramCache]: Analyzing trace with hash -978888674, now seen corresponding path program 1 times [2019-12-28 03:19:27,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:27,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134367063] [2019-12-28 03:19:27,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:27,462 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-28 03:19:27,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134367063] [2019-12-28 03:19:27,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:27,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:19:27,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2028217668] [2019-12-28 03:19:27,463 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:27,487 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:27,511 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 119 states and 170 transitions. [2019-12-28 03:19:27,511 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:27,513 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:27,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:19:27,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:27,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:19:27,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:19:27,515 INFO L87 Difference]: Start difference. First operand 15665 states and 44441 transitions. Second operand 4 states. [2019-12-28 03:19:28,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:28,194 INFO L93 Difference]: Finished difference Result 19289 states and 54888 transitions. [2019-12-28 03:19:28,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:19:28,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-28 03:19:28,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:28,220 INFO L225 Difference]: With dead ends: 19289 [2019-12-28 03:19:28,221 INFO L226 Difference]: Without dead ends: 19112 [2019-12-28 03:19:28,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:19:28,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19112 states. [2019-12-28 03:19:28,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19112 to 18239. [2019-12-28 03:19:28,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18239 states. [2019-12-28 03:19:28,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18239 states to 18239 states and 51794 transitions. [2019-12-28 03:19:28,457 INFO L78 Accepts]: Start accepts. Automaton has 18239 states and 51794 transitions. Word has length 66 [2019-12-28 03:19:28,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:28,457 INFO L462 AbstractCegarLoop]: Abstraction has 18239 states and 51794 transitions. [2019-12-28 03:19:28,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:19:28,458 INFO L276 IsEmpty]: Start isEmpty. Operand 18239 states and 51794 transitions. [2019-12-28 03:19:28,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 03:19:28,465 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:28,465 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:28,465 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:28,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:28,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1519127263, now seen corresponding path program 1 times [2019-12-28 03:19:28,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:28,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239548814] [2019-12-28 03:19:28,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:28,584 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-28 03:19:28,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239548814] [2019-12-28 03:19:28,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:28,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 03:19:28,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [309463445] [2019-12-28 03:19:28,586 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:28,596 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:28,621 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 119 states and 170 transitions. [2019-12-28 03:19:28,621 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:28,622 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:28,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 03:19:28,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:28,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 03:19:28,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:19:28,623 INFO L87 Difference]: Start difference. First operand 18239 states and 51794 transitions. Second operand 9 states. [2019-12-28 03:19:29,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:29,639 INFO L93 Difference]: Finished difference Result 24689 states and 69797 transitions. [2019-12-28 03:19:29,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 03:19:29,639 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-28 03:19:29,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:29,675 INFO L225 Difference]: With dead ends: 24689 [2019-12-28 03:19:29,676 INFO L226 Difference]: Without dead ends: 24689 [2019-12-28 03:19:29,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-28 03:19:29,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24689 states. [2019-12-28 03:19:29,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24689 to 21314. [2019-12-28 03:19:29,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21314 states. [2019-12-28 03:19:30,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21314 states to 21314 states and 60247 transitions. [2019-12-28 03:19:30,002 INFO L78 Accepts]: Start accepts. Automaton has 21314 states and 60247 transitions. Word has length 66 [2019-12-28 03:19:30,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:30,003 INFO L462 AbstractCegarLoop]: Abstraction has 21314 states and 60247 transitions. [2019-12-28 03:19:30,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 03:19:30,003 INFO L276 IsEmpty]: Start isEmpty. Operand 21314 states and 60247 transitions. [2019-12-28 03:19:30,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 03:19:30,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:30,010 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:30,010 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:30,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:30,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1888336352, now seen corresponding path program 1 times [2019-12-28 03:19:30,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:30,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817028880] [2019-12-28 03:19:30,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:30,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:30,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:19:30,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817028880] [2019-12-28 03:19:30,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:30,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:19:30,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1117166803] [2019-12-28 03:19:30,090 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:30,097 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:30,113 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 119 states and 170 transitions. [2019-12-28 03:19:30,113 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:30,114 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:30,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:19:30,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:30,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:19:30,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:19:30,115 INFO L87 Difference]: Start difference. First operand 21314 states and 60247 transitions. Second operand 5 states. [2019-12-28 03:19:30,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:30,166 INFO L93 Difference]: Finished difference Result 6356 states and 15007 transitions. [2019-12-28 03:19:30,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 03:19:30,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-28 03:19:30,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:30,173 INFO L225 Difference]: With dead ends: 6356 [2019-12-28 03:19:30,173 INFO L226 Difference]: Without dead ends: 5396 [2019-12-28 03:19:30,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:19:30,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5396 states. [2019-12-28 03:19:30,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5396 to 4648. [2019-12-28 03:19:30,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4648 states. [2019-12-28 03:19:30,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4648 states to 4648 states and 10675 transitions. [2019-12-28 03:19:30,219 INFO L78 Accepts]: Start accepts. Automaton has 4648 states and 10675 transitions. Word has length 66 [2019-12-28 03:19:30,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:30,220 INFO L462 AbstractCegarLoop]: Abstraction has 4648 states and 10675 transitions. [2019-12-28 03:19:30,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:19:30,220 INFO L276 IsEmpty]: Start isEmpty. Operand 4648 states and 10675 transitions. [2019-12-28 03:19:30,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 03:19:30,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:30,224 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:30,224 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:30,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:30,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1090796306, now seen corresponding path program 1 times [2019-12-28 03:19:30,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:30,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395867567] [2019-12-28 03:19:30,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:30,249 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-28 03:19:30,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395867567] [2019-12-28 03:19:30,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:30,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:19:30,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [116199022] [2019-12-28 03:19:30,250 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:30,260 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:30,274 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 66 transitions. [2019-12-28 03:19:30,275 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:30,275 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:30,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:19:30,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:30,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:19:30,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:19:30,276 INFO L87 Difference]: Start difference. First operand 4648 states and 10675 transitions. Second operand 3 states. [2019-12-28 03:19:30,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:30,320 INFO L93 Difference]: Finished difference Result 5729 states and 12974 transitions. [2019-12-28 03:19:30,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:19:30,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-28 03:19:30,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:30,328 INFO L225 Difference]: With dead ends: 5729 [2019-12-28 03:19:30,329 INFO L226 Difference]: Without dead ends: 5729 [2019-12-28 03:19:30,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:19:30,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5729 states. [2019-12-28 03:19:30,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5729 to 4571. [2019-12-28 03:19:30,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4571 states. [2019-12-28 03:19:30,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4571 states to 4571 states and 10222 transitions. [2019-12-28 03:19:30,385 INFO L78 Accepts]: Start accepts. Automaton has 4571 states and 10222 transitions. Word has length 66 [2019-12-28 03:19:30,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:30,385 INFO L462 AbstractCegarLoop]: Abstraction has 4571 states and 10222 transitions. [2019-12-28 03:19:30,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:19:30,385 INFO L276 IsEmpty]: Start isEmpty. Operand 4571 states and 10222 transitions. [2019-12-28 03:19:30,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-28 03:19:30,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:30,390 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:30,390 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:30,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:30,390 INFO L82 PathProgramCache]: Analyzing trace with hash -2889151, now seen corresponding path program 1 times [2019-12-28 03:19:30,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:30,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508336869] [2019-12-28 03:19:30,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:30,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:30,467 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-28 03:19:30,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508336869] [2019-12-28 03:19:30,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:30,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:19:30,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [122918890] [2019-12-28 03:19:30,469 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:30,481 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:30,500 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 72 transitions. [2019-12-28 03:19:30,500 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:30,501 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:30,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:19:30,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:30,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:19:30,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:19:30,502 INFO L87 Difference]: Start difference. First operand 4571 states and 10222 transitions. Second operand 5 states. [2019-12-28 03:19:30,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:30,690 INFO L93 Difference]: Finished difference Result 5642 states and 12670 transitions. [2019-12-28 03:19:30,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 03:19:30,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-12-28 03:19:30,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:30,698 INFO L225 Difference]: With dead ends: 5642 [2019-12-28 03:19:30,698 INFO L226 Difference]: Without dead ends: 5642 [2019-12-28 03:19:30,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:19:30,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2019-12-28 03:19:30,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 4991. [2019-12-28 03:19:30,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4991 states. [2019-12-28 03:19:30,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4991 states to 4991 states and 11180 transitions. [2019-12-28 03:19:30,745 INFO L78 Accepts]: Start accepts. Automaton has 4991 states and 11180 transitions. Word has length 72 [2019-12-28 03:19:30,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:30,745 INFO L462 AbstractCegarLoop]: Abstraction has 4991 states and 11180 transitions. [2019-12-28 03:19:30,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:19:30,745 INFO L276 IsEmpty]: Start isEmpty. Operand 4991 states and 11180 transitions. [2019-12-28 03:19:30,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-28 03:19:30,843 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:30,844 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:30,844 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:30,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:30,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1739921184, now seen corresponding path program 1 times [2019-12-28 03:19:30,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:30,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460101423] [2019-12-28 03:19:30,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:30,917 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-28 03:19:30,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460101423] [2019-12-28 03:19:30,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:30,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:19:30,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1624655196] [2019-12-28 03:19:30,918 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:30,931 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:30,951 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 72 transitions. [2019-12-28 03:19:30,952 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:30,952 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:30,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:19:30,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:30,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:19:30,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:19:30,953 INFO L87 Difference]: Start difference. First operand 4991 states and 11180 transitions. Second operand 7 states. [2019-12-28 03:19:31,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:31,373 INFO L93 Difference]: Finished difference Result 5857 states and 13026 transitions. [2019-12-28 03:19:31,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 03:19:31,374 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-12-28 03:19:31,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:31,380 INFO L225 Difference]: With dead ends: 5857 [2019-12-28 03:19:31,380 INFO L226 Difference]: Without dead ends: 5804 [2019-12-28 03:19:31,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-28 03:19:31,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5804 states. [2019-12-28 03:19:31,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5804 to 5022. [2019-12-28 03:19:31,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5022 states. [2019-12-28 03:19:31,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5022 states to 5022 states and 11180 transitions. [2019-12-28 03:19:31,427 INFO L78 Accepts]: Start accepts. Automaton has 5022 states and 11180 transitions. Word has length 72 [2019-12-28 03:19:31,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:31,428 INFO L462 AbstractCegarLoop]: Abstraction has 5022 states and 11180 transitions. [2019-12-28 03:19:31,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:19:31,428 INFO L276 IsEmpty]: Start isEmpty. Operand 5022 states and 11180 transitions. [2019-12-28 03:19:31,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-28 03:19:31,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:31,432 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:31,432 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:31,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:31,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1337768424, now seen corresponding path program 1 times [2019-12-28 03:19:31,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:31,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668379399] [2019-12-28 03:19:31,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:31,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:19:31,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668379399] [2019-12-28 03:19:31,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:31,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:19:31,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [652324817] [2019-12-28 03:19:31,495 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:31,517 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:31,626 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 200 states and 305 transitions. [2019-12-28 03:19:31,626 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:31,643 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:19:31,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:19:31,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:31,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:19:31,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:19:31,646 INFO L87 Difference]: Start difference. First operand 5022 states and 11180 transitions. Second operand 4 states. [2019-12-28 03:19:31,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:31,769 INFO L93 Difference]: Finished difference Result 6021 states and 13314 transitions. [2019-12-28 03:19:31,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:19:31,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-12-28 03:19:31,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:31,788 INFO L225 Difference]: With dead ends: 6021 [2019-12-28 03:19:31,788 INFO L226 Difference]: Without dead ends: 6021 [2019-12-28 03:19:31,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:19:31,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6021 states. [2019-12-28 03:19:31,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6021 to 5308. [2019-12-28 03:19:31,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5308 states. [2019-12-28 03:19:31,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5308 states to 5308 states and 11804 transitions. [2019-12-28 03:19:31,930 INFO L78 Accepts]: Start accepts. Automaton has 5308 states and 11804 transitions. Word has length 93 [2019-12-28 03:19:31,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:31,930 INFO L462 AbstractCegarLoop]: Abstraction has 5308 states and 11804 transitions. [2019-12-28 03:19:31,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:19:31,931 INFO L276 IsEmpty]: Start isEmpty. Operand 5308 states and 11804 transitions. [2019-12-28 03:19:31,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 03:19:31,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:31,942 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:31,942 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:31,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:31,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1928051890, now seen corresponding path program 1 times [2019-12-28 03:19:31,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:31,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046371207] [2019-12-28 03:19:31,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:32,017 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-28 03:19:32,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046371207] [2019-12-28 03:19:32,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:32,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:19:32,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [451841881] [2019-12-28 03:19:32,018 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:32,042 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:32,152 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 204 states and 311 transitions. [2019-12-28 03:19:32,152 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:32,154 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:19:32,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:19:32,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:32,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:19:32,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:19:32,155 INFO L87 Difference]: Start difference. First operand 5308 states and 11804 transitions. Second operand 5 states. [2019-12-28 03:19:32,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:32,262 INFO L93 Difference]: Finished difference Result 5797 states and 12867 transitions. [2019-12-28 03:19:32,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 03:19:32,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-28 03:19:32,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:32,270 INFO L225 Difference]: With dead ends: 5797 [2019-12-28 03:19:32,270 INFO L226 Difference]: Without dead ends: 5797 [2019-12-28 03:19:32,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:19:32,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5797 states. [2019-12-28 03:19:32,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5797 to 4433. [2019-12-28 03:19:32,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4433 states. [2019-12-28 03:19:32,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4433 states to 4433 states and 9850 transitions. [2019-12-28 03:19:32,363 INFO L78 Accepts]: Start accepts. Automaton has 4433 states and 9850 transitions. Word has length 95 [2019-12-28 03:19:32,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:32,364 INFO L462 AbstractCegarLoop]: Abstraction has 4433 states and 9850 transitions. [2019-12-28 03:19:32,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:19:32,364 INFO L276 IsEmpty]: Start isEmpty. Operand 4433 states and 9850 transitions. [2019-12-28 03:19:32,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 03:19:32,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:32,371 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:32,372 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:32,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:32,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1916735763, now seen corresponding path program 1 times [2019-12-28 03:19:32,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:32,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311481267] [2019-12-28 03:19:32,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:32,438 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-28 03:19:32,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311481267] [2019-12-28 03:19:32,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:32,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:19:32,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [851628519] [2019-12-28 03:19:32,439 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:32,463 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:32,582 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 204 states and 311 transitions. [2019-12-28 03:19:32,583 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:32,585 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:19:32,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:19:32,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:32,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:19:32,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:19:32,586 INFO L87 Difference]: Start difference. First operand 4433 states and 9850 transitions. Second operand 4 states. [2019-12-28 03:19:32,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:32,723 INFO L93 Difference]: Finished difference Result 4864 states and 10817 transitions. [2019-12-28 03:19:32,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:19:32,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-28 03:19:32,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:32,731 INFO L225 Difference]: With dead ends: 4864 [2019-12-28 03:19:32,732 INFO L226 Difference]: Without dead ends: 4864 [2019-12-28 03:19:32,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:19:32,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4864 states. [2019-12-28 03:19:32,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4864 to 4504. [2019-12-28 03:19:32,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4504 states. [2019-12-28 03:19:32,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4504 states to 4504 states and 10001 transitions. [2019-12-28 03:19:32,830 INFO L78 Accepts]: Start accepts. Automaton has 4504 states and 10001 transitions. Word has length 95 [2019-12-28 03:19:32,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:32,830 INFO L462 AbstractCegarLoop]: Abstraction has 4504 states and 10001 transitions. [2019-12-28 03:19:32,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:19:32,831 INFO L276 IsEmpty]: Start isEmpty. Operand 4504 states and 10001 transitions. [2019-12-28 03:19:32,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 03:19:32,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:32,839 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:32,839 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:32,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:32,840 INFO L82 PathProgramCache]: Analyzing trace with hash 70745997, now seen corresponding path program 1 times [2019-12-28 03:19:32,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:32,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463135842] [2019-12-28 03:19:32,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:32,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:32,913 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-28 03:19:32,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463135842] [2019-12-28 03:19:32,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:32,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:19:32,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1489421221] [2019-12-28 03:19:32,914 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:32,939 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:33,060 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 204 states and 311 transitions. [2019-12-28 03:19:33,060 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:33,063 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 03:19:33,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:19:33,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:33,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:19:33,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:19:33,064 INFO L87 Difference]: Start difference. First operand 4504 states and 10001 transitions. Second operand 4 states. [2019-12-28 03:19:33,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:33,332 INFO L93 Difference]: Finished difference Result 5732 states and 12656 transitions. [2019-12-28 03:19:33,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:19:33,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-28 03:19:33,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:33,340 INFO L225 Difference]: With dead ends: 5732 [2019-12-28 03:19:33,340 INFO L226 Difference]: Without dead ends: 5680 [2019-12-28 03:19:33,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-28 03:19:33,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5680 states. [2019-12-28 03:19:33,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5680 to 5377. [2019-12-28 03:19:33,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5377 states. [2019-12-28 03:19:33,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5377 states to 5377 states and 11898 transitions. [2019-12-28 03:19:33,530 INFO L78 Accepts]: Start accepts. Automaton has 5377 states and 11898 transitions. Word has length 95 [2019-12-28 03:19:33,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:33,530 INFO L462 AbstractCegarLoop]: Abstraction has 5377 states and 11898 transitions. [2019-12-28 03:19:33,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:19:33,530 INFO L276 IsEmpty]: Start isEmpty. Operand 5377 states and 11898 transitions. [2019-12-28 03:19:33,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 03:19:33,538 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:33,538 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:33,538 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:33,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:33,539 INFO L82 PathProgramCache]: Analyzing trace with hash 301022190, now seen corresponding path program 1 times [2019-12-28 03:19:33,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:33,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156995485] [2019-12-28 03:19:33,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:33,648 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-28 03:19:33,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156995485] [2019-12-28 03:19:33,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:33,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:19:33,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1038587179] [2019-12-28 03:19:33,649 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:33,673 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:33,792 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 204 states and 311 transitions. [2019-12-28 03:19:33,793 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:33,795 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:19:33,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:19:33,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:33,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:19:33,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:19:33,796 INFO L87 Difference]: Start difference. First operand 5377 states and 11898 transitions. Second operand 7 states. [2019-12-28 03:19:34,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:34,233 INFO L93 Difference]: Finished difference Result 7207 states and 15907 transitions. [2019-12-28 03:19:34,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-28 03:19:34,234 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-28 03:19:34,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:34,243 INFO L225 Difference]: With dead ends: 7207 [2019-12-28 03:19:34,243 INFO L226 Difference]: Without dead ends: 7207 [2019-12-28 03:19:34,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-28 03:19:34,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7207 states. [2019-12-28 03:19:34,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7207 to 6478. [2019-12-28 03:19:34,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6478 states. [2019-12-28 03:19:34,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6478 states to 6478 states and 14325 transitions. [2019-12-28 03:19:34,340 INFO L78 Accepts]: Start accepts. Automaton has 6478 states and 14325 transitions. Word has length 95 [2019-12-28 03:19:34,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:34,341 INFO L462 AbstractCegarLoop]: Abstraction has 6478 states and 14325 transitions. [2019-12-28 03:19:34,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:19:34,341 INFO L276 IsEmpty]: Start isEmpty. Operand 6478 states and 14325 transitions. [2019-12-28 03:19:34,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 03:19:34,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:34,349 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:34,349 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:34,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:34,350 INFO L82 PathProgramCache]: Analyzing trace with hash -2006463346, now seen corresponding path program 1 times [2019-12-28 03:19:34,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:34,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630653904] [2019-12-28 03:19:34,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:34,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:34,523 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-28 03:19:34,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630653904] [2019-12-28 03:19:34,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:34,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-28 03:19:34,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1969906725] [2019-12-28 03:19:34,524 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:34,547 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:34,676 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 204 states and 311 transitions. [2019-12-28 03:19:34,677 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:34,752 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-28 03:19:34,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-28 03:19:34,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:34,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-28 03:19:34,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-12-28 03:19:34,753 INFO L87 Difference]: Start difference. First operand 6478 states and 14325 transitions. Second operand 15 states. [2019-12-28 03:19:37,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:37,656 INFO L93 Difference]: Finished difference Result 10646 states and 23054 transitions. [2019-12-28 03:19:37,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-28 03:19:37,656 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 95 [2019-12-28 03:19:37,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:37,667 INFO L225 Difference]: With dead ends: 10646 [2019-12-28 03:19:37,668 INFO L226 Difference]: Without dead ends: 10646 [2019-12-28 03:19:37,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=207, Invalid=1125, Unknown=0, NotChecked=0, Total=1332 [2019-12-28 03:19:37,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10646 states. [2019-12-28 03:19:37,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10646 to 7371. [2019-12-28 03:19:37,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7371 states. [2019-12-28 03:19:37,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7371 states to 7371 states and 16263 transitions. [2019-12-28 03:19:37,761 INFO L78 Accepts]: Start accepts. Automaton has 7371 states and 16263 transitions. Word has length 95 [2019-12-28 03:19:37,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:37,762 INFO L462 AbstractCegarLoop]: Abstraction has 7371 states and 16263 transitions. [2019-12-28 03:19:37,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-28 03:19:37,762 INFO L276 IsEmpty]: Start isEmpty. Operand 7371 states and 16263 transitions. [2019-12-28 03:19:37,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 03:19:37,771 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:37,771 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:37,771 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:37,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:37,772 INFO L82 PathProgramCache]: Analyzing trace with hash -907608752, now seen corresponding path program 1 times [2019-12-28 03:19:37,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:37,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66797308] [2019-12-28 03:19:37,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:37,892 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-28 03:19:37,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66797308] [2019-12-28 03:19:37,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:37,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-28 03:19:37,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [749253164] [2019-12-28 03:19:37,893 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:37,917 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:38,052 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 204 states and 311 transitions. [2019-12-28 03:19:38,053 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:38,274 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-12-28 03:19:38,326 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-28 03:19:38,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-28 03:19:38,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:38,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-28 03:19:38,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-12-28 03:19:38,327 INFO L87 Difference]: Start difference. First operand 7371 states and 16263 transitions. Second operand 12 states. [2019-12-28 03:19:41,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:41,058 INFO L93 Difference]: Finished difference Result 25850 states and 57581 transitions. [2019-12-28 03:19:41,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-28 03:19:41,058 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 95 [2019-12-28 03:19:41,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:41,078 INFO L225 Difference]: With dead ends: 25850 [2019-12-28 03:19:41,078 INFO L226 Difference]: Without dead ends: 16044 [2019-12-28 03:19:41,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=194, Invalid=1138, Unknown=0, NotChecked=0, Total=1332 [2019-12-28 03:19:41,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16044 states. [2019-12-28 03:19:41,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16044 to 7186. [2019-12-28 03:19:41,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7186 states. [2019-12-28 03:19:41,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7186 states to 7186 states and 15785 transitions. [2019-12-28 03:19:41,220 INFO L78 Accepts]: Start accepts. Automaton has 7186 states and 15785 transitions. Word has length 95 [2019-12-28 03:19:41,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:41,220 INFO L462 AbstractCegarLoop]: Abstraction has 7186 states and 15785 transitions. [2019-12-28 03:19:41,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-28 03:19:41,220 INFO L276 IsEmpty]: Start isEmpty. Operand 7186 states and 15785 transitions. [2019-12-28 03:19:41,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 03:19:41,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:41,226 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:41,227 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:41,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:41,227 INFO L82 PathProgramCache]: Analyzing trace with hash -4328754, now seen corresponding path program 2 times [2019-12-28 03:19:41,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:41,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752933413] [2019-12-28 03:19:41,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 03:19:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 03:19:41,316 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 03:19:41,316 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 03:19:41,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 03:19:41 BasicIcfg [2019-12-28 03:19:41,486 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 03:19:41,488 INFO L168 Benchmark]: Toolchain (without parser) took 58222.53 ms. Allocated memory was 145.2 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 101.6 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-28 03:19:41,489 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 145.2 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-28 03:19:41,489 INFO L168 Benchmark]: CACSL2BoogieTranslator took 777.44 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.2 MB in the beginning and 155.2 MB in the end (delta: -54.0 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2019-12-28 03:19:41,490 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.19 ms. Allocated memory is still 202.9 MB. Free memory was 155.2 MB in the beginning and 153.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-28 03:19:41,490 INFO L168 Benchmark]: Boogie Preprocessor took 58.83 ms. Allocated memory is still 202.9 MB. Free memory was 153.2 MB in the beginning and 150.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-28 03:19:41,491 INFO L168 Benchmark]: RCFGBuilder took 806.11 ms. Allocated memory is still 202.9 MB. Free memory was 150.5 MB in the beginning and 106.2 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2019-12-28 03:19:41,491 INFO L168 Benchmark]: TraceAbstraction took 56504.56 ms. Allocated memory was 202.9 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 106.2 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-28 03:19:41,494 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.24 ms. Allocated memory is still 145.2 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 777.44 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.2 MB in the beginning and 155.2 MB in the end (delta: -54.0 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.19 ms. Allocated memory is still 202.9 MB. Free memory was 155.2 MB in the beginning and 153.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 58.83 ms. Allocated memory is still 202.9 MB. Free memory was 153.2 MB in the beginning and 150.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 806.11 ms. Allocated memory is still 202.9 MB. Free memory was 150.5 MB in the beginning and 106.2 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 56504.56 ms. Allocated memory was 202.9 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 106.2 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L697] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L698] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L700] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L703] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L704] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L705] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L706] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L707] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L708] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L709] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L710] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L711] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L712] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L713] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L714] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L715] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L716] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] 0 pthread_t t1443; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] FCALL, FORK 0 pthread_create(&t1443, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 1 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L793] 0 pthread_t t1444; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t1444, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 x = 2 [L753] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L757] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L758] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L758] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L760] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L763] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y = y$flush_delayed ? y$mem_tmp : y [L766] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L807] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 56.1s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 23.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8202 SDtfs, 8607 SDslu, 22377 SDs, 0 SdLazy, 11100 SolverSat, 494 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 346 GetRequests, 109 SyntacticMatches, 16 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71011occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 24.3s AutomataMinimizationTime, 29 MinimizatonAttempts, 91108 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 2036 NumberOfCodeBlocks, 2036 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1912 ConstructedInterpolants, 0 QuantifiedInterpolants, 328986 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...