/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/mix022_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 01:18:08,520 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 01:18:08,524 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 01:18:08,543 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 01:18:08,544 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 01:18:08,546 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 01:18:08,548 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 01:18:08,561 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 01:18:08,562 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 01:18:08,564 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 01:18:08,565 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 01:18:08,566 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 01:18:08,567 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 01:18:08,567 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 01:18:08,571 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 01:18:08,574 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 01:18:08,575 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 01:18:08,578 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 01:18:08,581 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 01:18:08,587 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 01:18:08,589 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 01:18:08,593 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 01:18:08,594 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 01:18:08,595 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 01:18:08,598 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 01:18:08,598 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 01:18:08,598 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 01:18:08,600 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 01:18:08,602 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 01:18:08,603 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 01:18:08,603 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 01:18:08,605 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 01:18:08,606 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 01:18:08,607 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 01:18:08,611 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 01:18:08,611 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 01:18:08,613 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 01:18:08,613 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 01:18:08,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 01:18:08,615 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 01:18:08,616 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 01:18:08,617 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 01:18:08,637 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 01:18:08,637 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 01:18:08,638 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 01:18:08,638 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 01:18:08,639 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 01:18:08,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 01:18:08,639 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 01:18:08,639 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 01:18:08,640 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 01:18:08,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 01:18:08,640 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 01:18:08,640 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 01:18:08,640 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 01:18:08,641 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 01:18:08,641 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 01:18:08,641 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 01:18:08,641 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 01:18:08,642 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 01:18:08,642 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 01:18:08,642 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 01:18:08,642 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 01:18:08,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 01:18:08,643 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 01:18:08,643 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 01:18:08,643 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 01:18:08,643 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 01:18:08,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 01:18:08,644 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 01:18:08,644 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 01:18:08,644 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 01:18:08,644 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 01:18:08,645 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 01:18:08,944 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 01:18:08,960 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 01:18:08,963 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 01:18:08,965 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 01:18:08,965 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 01:18:08,965 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_rmo.opt.i [2019-12-28 01:18:09,038 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca9c079a4/d4334e3d0f5d436fb6d0f6903cc9c3ef/FLAG80df2fc61 [2019-12-28 01:18:09,608 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 01:18:09,609 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_rmo.opt.i [2019-12-28 01:18:09,638 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca9c079a4/d4334e3d0f5d436fb6d0f6903cc9c3ef/FLAG80df2fc61 [2019-12-28 01:18:09,926 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca9c079a4/d4334e3d0f5d436fb6d0f6903cc9c3ef [2019-12-28 01:18:09,937 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 01:18:09,939 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 01:18:09,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 01:18:09,941 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 01:18:09,944 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 01:18:09,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 01:18:09" (1/1) ... [2019-12-28 01:18:09,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2717e766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:18:09, skipping insertion in model container [2019-12-28 01:18:09,949 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 01:18:09" (1/1) ... [2019-12-28 01:18:09,956 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 01:18:10,018 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 01:18:10,549 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 01:18:10,568 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 01:18:10,681 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 01:18:10,789 INFO L208 MainTranslator]: Completed translation [2019-12-28 01:18:10,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:18:10 WrapperNode [2019-12-28 01:18:10,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 01:18:10,791 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 01:18:10,791 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 01:18:10,792 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 01:18:10,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:18:10" (1/1) ... [2019-12-28 01:18:10,842 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:18:10" (1/1) ... [2019-12-28 01:18:10,875 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 01:18:10,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 01:18:10,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 01:18:10,876 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 01:18:10,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:18:10" (1/1) ... [2019-12-28 01:18:10,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:18:10" (1/1) ... [2019-12-28 01:18:10,896 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:18:10" (1/1) ... [2019-12-28 01:18:10,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:18:10" (1/1) ... [2019-12-28 01:18:10,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:18:10" (1/1) ... [2019-12-28 01:18:10,910 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:18:10" (1/1) ... [2019-12-28 01:18:10,913 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:18:10" (1/1) ... [2019-12-28 01:18:10,919 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 01:18:10,919 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 01:18:10,919 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 01:18:10,920 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 01:18:10,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:18:10" (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 01:18:10,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 01:18:11,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 01:18:11,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 01:18:11,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 01:18:11,001 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 01:18:11,001 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 01:18:11,001 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 01:18:11,001 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 01:18:11,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 01:18:11,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 01:18:11,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 01:18:11,004 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 01:18:11,751 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 01:18:11,751 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 01:18:11,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:18:11 BoogieIcfgContainer [2019-12-28 01:18:11,753 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 01:18:11,755 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 01:18:11,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 01:18:11,759 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 01:18:11,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 01:18:09" (1/3) ... [2019-12-28 01:18:11,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@632b364a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 01:18:11, skipping insertion in model container [2019-12-28 01:18:11,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:18:10" (2/3) ... [2019-12-28 01:18:11,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@632b364a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 01:18:11, skipping insertion in model container [2019-12-28 01:18:11,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:18:11" (3/3) ... [2019-12-28 01:18:11,765 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_rmo.opt.i [2019-12-28 01:18:11,776 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 01:18:11,777 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 01:18:11,789 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 01:18:11,790 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 01:18:11,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,835 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,835 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,836 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,836 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,837 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,853 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,853 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,925 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,925 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,926 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,934 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,937 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:18:11,953 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 01:18:11,978 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 01:18:11,979 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 01:18:11,979 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 01:18:11,979 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 01:18:11,979 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 01:18:11,979 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 01:18:11,979 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 01:18:11,979 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 01:18:12,000 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 147 places, 181 transitions [2019-12-28 01:18:14,042 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32591 states. [2019-12-28 01:18:14,044 INFO L276 IsEmpty]: Start isEmpty. Operand 32591 states. [2019-12-28 01:18:14,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-28 01:18:14,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:18:14,053 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:18:14,054 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:18:14,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:18:14,059 INFO L82 PathProgramCache]: Analyzing trace with hash 515763664, now seen corresponding path program 1 times [2019-12-28 01:18:14,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:18:14,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740766875] [2019-12-28 01:18:14,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:18:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:18:14,485 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 01:18:14,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740766875] [2019-12-28 01:18:14,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:18:14,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:18:14,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [317524980] [2019-12-28 01:18:14,489 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:18:14,495 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:18:14,514 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 34 transitions. [2019-12-28 01:18:14,514 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:18:14,519 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:18:14,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:18:14,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:18:14,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:18:14,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:18:14,537 INFO L87 Difference]: Start difference. First operand 32591 states. Second operand 4 states. [2019-12-28 01:18:15,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:18:15,325 INFO L93 Difference]: Finished difference Result 33591 states and 129568 transitions. [2019-12-28 01:18:15,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 01:18:15,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-28 01:18:15,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:18:16,617 INFO L225 Difference]: With dead ends: 33591 [2019-12-28 01:18:16,618 INFO L226 Difference]: Without dead ends: 25703 [2019-12-28 01:18:16,622 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 01:18:17,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25703 states. [2019-12-28 01:18:17,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25703 to 25703. [2019-12-28 01:18:17,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25703 states. [2019-12-28 01:18:18,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25703 states to 25703 states and 99584 transitions. [2019-12-28 01:18:18,059 INFO L78 Accepts]: Start accepts. Automaton has 25703 states and 99584 transitions. Word has length 34 [2019-12-28 01:18:18,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:18:18,060 INFO L462 AbstractCegarLoop]: Abstraction has 25703 states and 99584 transitions. [2019-12-28 01:18:18,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:18:18,060 INFO L276 IsEmpty]: Start isEmpty. Operand 25703 states and 99584 transitions. [2019-12-28 01:18:18,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-28 01:18:18,071 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:18:18,071 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 01:18:18,071 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:18:18,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:18:18,072 INFO L82 PathProgramCache]: Analyzing trace with hash 471938879, now seen corresponding path program 1 times [2019-12-28 01:18:18,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:18:18,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856813037] [2019-12-28 01:18:18,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:18:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:18:18,217 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 01:18:18,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856813037] [2019-12-28 01:18:18,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:18:18,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:18:18,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [429925539] [2019-12-28 01:18:18,218 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:18:18,223 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:18:18,230 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 47 states and 46 transitions. [2019-12-28 01:18:18,231 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:18:18,231 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:18:18,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:18:18,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:18:18,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:18:18,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:18:18,234 INFO L87 Difference]: Start difference. First operand 25703 states and 99584 transitions. Second operand 5 states. [2019-12-28 01:18:19,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:18:19,387 INFO L93 Difference]: Finished difference Result 41081 states and 150431 transitions. [2019-12-28 01:18:19,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:18:19,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-28 01:18:19,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:18:19,574 INFO L225 Difference]: With dead ends: 41081 [2019-12-28 01:18:19,574 INFO L226 Difference]: Without dead ends: 40545 [2019-12-28 01:18:19,575 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 01:18:21,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40545 states. [2019-12-28 01:18:22,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40545 to 38925. [2019-12-28 01:18:22,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38925 states. [2019-12-28 01:18:22,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38925 states to 38925 states and 143581 transitions. [2019-12-28 01:18:22,287 INFO L78 Accepts]: Start accepts. Automaton has 38925 states and 143581 transitions. Word has length 46 [2019-12-28 01:18:22,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:18:22,288 INFO L462 AbstractCegarLoop]: Abstraction has 38925 states and 143581 transitions. [2019-12-28 01:18:22,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:18:22,289 INFO L276 IsEmpty]: Start isEmpty. Operand 38925 states and 143581 transitions. [2019-12-28 01:18:22,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-28 01:18:22,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:18:22,295 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:18:22,296 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:18:22,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:18:22,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1446923185, now seen corresponding path program 1 times [2019-12-28 01:18:22,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:18:22,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399738460] [2019-12-28 01:18:22,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:18:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:18:22,402 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 01:18:22,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399738460] [2019-12-28 01:18:22,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:18:22,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:18:22,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1997897578] [2019-12-28 01:18:22,404 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:18:22,410 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:18:22,415 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 47 transitions. [2019-12-28 01:18:22,416 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:18:22,416 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:18:22,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:18:22,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:18:22,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:18:22,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:18:22,418 INFO L87 Difference]: Start difference. First operand 38925 states and 143581 transitions. Second operand 5 states. [2019-12-28 01:18:23,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:18:23,064 INFO L93 Difference]: Finished difference Result 49778 states and 180633 transitions. [2019-12-28 01:18:23,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:18:23,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-28 01:18:23,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:18:24,889 INFO L225 Difference]: With dead ends: 49778 [2019-12-28 01:18:24,889 INFO L226 Difference]: Without dead ends: 49274 [2019-12-28 01:18:24,890 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 01:18:25,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49274 states. [2019-12-28 01:18:26,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49274 to 42677. [2019-12-28 01:18:26,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42677 states. [2019-12-28 01:18:26,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42677 states to 42677 states and 156592 transitions. [2019-12-28 01:18:26,431 INFO L78 Accepts]: Start accepts. Automaton has 42677 states and 156592 transitions. Word has length 47 [2019-12-28 01:18:26,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:18:26,431 INFO L462 AbstractCegarLoop]: Abstraction has 42677 states and 156592 transitions. [2019-12-28 01:18:26,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:18:26,432 INFO L276 IsEmpty]: Start isEmpty. Operand 42677 states and 156592 transitions. [2019-12-28 01:18:26,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-28 01:18:26,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:18:26,441 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:18:26,441 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:18:26,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:18:26,442 INFO L82 PathProgramCache]: Analyzing trace with hash -104992681, now seen corresponding path program 1 times [2019-12-28 01:18:26,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:18:26,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503034296] [2019-12-28 01:18:26,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:18:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:18:26,496 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 01:18:26,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503034296] [2019-12-28 01:18:26,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:18:26,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 01:18:26,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1043707920] [2019-12-28 01:18:26,498 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:18:26,505 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:18:26,511 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 49 transitions. [2019-12-28 01:18:26,511 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:18:26,513 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:18:26,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 01:18:26,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:18:26,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 01:18:26,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 01:18:26,520 INFO L87 Difference]: Start difference. First operand 42677 states and 156592 transitions. Second operand 3 states. [2019-12-28 01:18:26,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:18:26,909 INFO L93 Difference]: Finished difference Result 61087 states and 221430 transitions. [2019-12-28 01:18:26,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 01:18:26,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-12-28 01:18:26,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:18:27,584 INFO L225 Difference]: With dead ends: 61087 [2019-12-28 01:18:27,584 INFO L226 Difference]: Without dead ends: 61087 [2019-12-28 01:18:27,584 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 01:18:27,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61087 states. [2019-12-28 01:18:30,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61087 to 48016. [2019-12-28 01:18:30,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48016 states. [2019-12-28 01:18:30,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48016 states to 48016 states and 174179 transitions. [2019-12-28 01:18:30,731 INFO L78 Accepts]: Start accepts. Automaton has 48016 states and 174179 transitions. Word has length 49 [2019-12-28 01:18:30,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:18:30,731 INFO L462 AbstractCegarLoop]: Abstraction has 48016 states and 174179 transitions. [2019-12-28 01:18:30,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 01:18:30,731 INFO L276 IsEmpty]: Start isEmpty. Operand 48016 states and 174179 transitions. [2019-12-28 01:18:30,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-28 01:18:30,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:18:30,746 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 01:18:30,746 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:18:30,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:18:30,747 INFO L82 PathProgramCache]: Analyzing trace with hash -604414232, now seen corresponding path program 1 times [2019-12-28 01:18:30,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:18:30,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891689313] [2019-12-28 01:18:30,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:18:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:18:30,809 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 01:18:30,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891689313] [2019-12-28 01:18:30,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:18:30,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 01:18:30,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [627484230] [2019-12-28 01:18:30,810 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:18:30,816 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:18:30,823 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 65 transitions. [2019-12-28 01:18:30,823 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:18:30,826 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:18:30,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 01:18:30,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:18:30,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 01:18:30,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 01:18:30,827 INFO L87 Difference]: Start difference. First operand 48016 states and 174179 transitions. Second operand 3 states. [2019-12-28 01:18:31,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:18:31,296 INFO L93 Difference]: Finished difference Result 53336 states and 193527 transitions. [2019-12-28 01:18:31,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 01:18:31,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-28 01:18:31,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:18:31,445 INFO L225 Difference]: With dead ends: 53336 [2019-12-28 01:18:31,445 INFO L226 Difference]: Without dead ends: 53336 [2019-12-28 01:18:31,445 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 01:18:31,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53336 states. [2019-12-28 01:18:32,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53336 to 50674. [2019-12-28 01:18:32,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50674 states. [2019-12-28 01:18:32,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50674 states to 50674 states and 183847 transitions. [2019-12-28 01:18:32,826 INFO L78 Accepts]: Start accepts. Automaton has 50674 states and 183847 transitions. Word has length 53 [2019-12-28 01:18:32,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:18:32,826 INFO L462 AbstractCegarLoop]: Abstraction has 50674 states and 183847 transitions. [2019-12-28 01:18:32,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 01:18:32,826 INFO L276 IsEmpty]: Start isEmpty. Operand 50674 states and 183847 transitions. [2019-12-28 01:18:32,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-28 01:18:32,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:18:32,841 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 01:18:32,841 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:18:32,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:18:32,842 INFO L82 PathProgramCache]: Analyzing trace with hash -2118465688, now seen corresponding path program 1 times [2019-12-28 01:18:32,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:18:32,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755696155] [2019-12-28 01:18:32,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:18:32,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:18:32,977 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 01:18:32,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755696155] [2019-12-28 01:18:32,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:18:32,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:18:32,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1975517802] [2019-12-28 01:18:32,979 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:18:32,985 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:18:32,991 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 65 transitions. [2019-12-28 01:18:32,992 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:18:32,993 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:18:32,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:18:32,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:18:32,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:18:32,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:18:32,994 INFO L87 Difference]: Start difference. First operand 50674 states and 183847 transitions. Second operand 6 states. [2019-12-28 01:18:34,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:18:34,313 INFO L93 Difference]: Finished difference Result 65266 states and 234905 transitions. [2019-12-28 01:18:34,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:18:34,313 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-28 01:18:34,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:18:34,462 INFO L225 Difference]: With dead ends: 65266 [2019-12-28 01:18:34,462 INFO L226 Difference]: Without dead ends: 65266 [2019-12-28 01:18:34,462 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 01:18:34,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65266 states. [2019-12-28 01:18:37,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65266 to 59949. [2019-12-28 01:18:37,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59949 states. [2019-12-28 01:18:37,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59949 states to 59949 states and 215672 transitions. [2019-12-28 01:18:37,739 INFO L78 Accepts]: Start accepts. Automaton has 59949 states and 215672 transitions. Word has length 53 [2019-12-28 01:18:37,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:18:37,740 INFO L462 AbstractCegarLoop]: Abstraction has 59949 states and 215672 transitions. [2019-12-28 01:18:37,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:18:37,740 INFO L276 IsEmpty]: Start isEmpty. Operand 59949 states and 215672 transitions. [2019-12-28 01:18:37,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-28 01:18:37,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:18:37,753 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 01:18:37,753 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:18:37,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:18:37,753 INFO L82 PathProgramCache]: Analyzing trace with hash 379550249, now seen corresponding path program 1 times [2019-12-28 01:18:37,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:18:37,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950611749] [2019-12-28 01:18:37,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:18:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:18:37,864 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 01:18:37,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950611749] [2019-12-28 01:18:37,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:18:37,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:18:37,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [487569858] [2019-12-28 01:18:37,866 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:18:37,872 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:18:37,878 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 65 transitions. [2019-12-28 01:18:37,879 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:18:37,879 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:18:37,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 01:18:37,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:18:37,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 01:18:37,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:18:37,881 INFO L87 Difference]: Start difference. First operand 59949 states and 215672 transitions. Second operand 7 states. [2019-12-28 01:18:39,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:18:39,217 INFO L93 Difference]: Finished difference Result 83685 states and 290097 transitions. [2019-12-28 01:18:39,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 01:18:39,221 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-28 01:18:39,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:18:39,955 INFO L225 Difference]: With dead ends: 83685 [2019-12-28 01:18:39,956 INFO L226 Difference]: Without dead ends: 83685 [2019-12-28 01:18:39,956 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 01:18:40,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83685 states. [2019-12-28 01:18:44,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83685 to 71012. [2019-12-28 01:18:44,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71012 states. [2019-12-28 01:18:44,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71012 states to 71012 states and 249886 transitions. [2019-12-28 01:18:44,280 INFO L78 Accepts]: Start accepts. Automaton has 71012 states and 249886 transitions. Word has length 53 [2019-12-28 01:18:44,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:18:44,281 INFO L462 AbstractCegarLoop]: Abstraction has 71012 states and 249886 transitions. [2019-12-28 01:18:44,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 01:18:44,281 INFO L276 IsEmpty]: Start isEmpty. Operand 71012 states and 249886 transitions. [2019-12-28 01:18:44,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-28 01:18:44,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:18:44,295 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 01:18:44,295 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:18:44,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:18:44,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1267053930, now seen corresponding path program 1 times [2019-12-28 01:18:44,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:18:44,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509628204] [2019-12-28 01:18:44,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:18:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:18:44,349 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 01:18:44,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509628204] [2019-12-28 01:18:44,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:18:44,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 01:18:44,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [184497928] [2019-12-28 01:18:44,351 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:18:44,357 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:18:44,363 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 65 transitions. [2019-12-28 01:18:44,363 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:18:44,364 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:18:44,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 01:18:44,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:18:44,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 01:18:44,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 01:18:44,365 INFO L87 Difference]: Start difference. First operand 71012 states and 249886 transitions. Second operand 3 states. [2019-12-28 01:18:44,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:18:44,719 INFO L93 Difference]: Finished difference Result 54021 states and 188918 transitions. [2019-12-28 01:18:44,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 01:18:44,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-28 01:18:44,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:18:44,873 INFO L225 Difference]: With dead ends: 54021 [2019-12-28 01:18:44,873 INFO L226 Difference]: Without dead ends: 54021 [2019-12-28 01:18:44,874 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 01:18:45,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54021 states. [2019-12-28 01:18:46,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54021 to 53406. [2019-12-28 01:18:46,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53406 states. [2019-12-28 01:18:46,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53406 states to 53406 states and 187037 transitions. [2019-12-28 01:18:46,237 INFO L78 Accepts]: Start accepts. Automaton has 53406 states and 187037 transitions. Word has length 53 [2019-12-28 01:18:46,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:18:46,238 INFO L462 AbstractCegarLoop]: Abstraction has 53406 states and 187037 transitions. [2019-12-28 01:18:46,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 01:18:46,238 INFO L276 IsEmpty]: Start isEmpty. Operand 53406 states and 187037 transitions. [2019-12-28 01:18:46,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-28 01:18:46,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:18:46,247 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 01:18:46,247 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:18:46,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:18:46,248 INFO L82 PathProgramCache]: Analyzing trace with hash -2125589086, now seen corresponding path program 1 times [2019-12-28 01:18:46,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:18:46,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696302031] [2019-12-28 01:18:46,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:18:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:18:46,313 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 01:18:46,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696302031] [2019-12-28 01:18:46,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:18:46,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:18:46,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1608211698] [2019-12-28 01:18:46,314 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:18:46,324 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:18:46,332 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 54 states and 53 transitions. [2019-12-28 01:18:46,332 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:18:46,333 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:18:46,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:18:46,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:18:46,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:18:46,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:18:46,335 INFO L87 Difference]: Start difference. First operand 53406 states and 187037 transitions. Second operand 6 states. [2019-12-28 01:18:47,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:18:47,093 INFO L93 Difference]: Finished difference Result 68646 states and 237301 transitions. [2019-12-28 01:18:47,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 01:18:47,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-28 01:18:47,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:18:47,241 INFO L225 Difference]: With dead ends: 68646 [2019-12-28 01:18:47,242 INFO L226 Difference]: Without dead ends: 68078 [2019-12-28 01:18:47,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-28 01:18:47,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68078 states. [2019-12-28 01:18:48,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68078 to 53490. [2019-12-28 01:18:48,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53490 states. [2019-12-28 01:18:48,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53490 states to 53490 states and 187734 transitions. [2019-12-28 01:18:48,880 INFO L78 Accepts]: Start accepts. Automaton has 53490 states and 187734 transitions. Word has length 53 [2019-12-28 01:18:48,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:18:48,880 INFO L462 AbstractCegarLoop]: Abstraction has 53490 states and 187734 transitions. [2019-12-28 01:18:48,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:18:48,881 INFO L276 IsEmpty]: Start isEmpty. Operand 53490 states and 187734 transitions. [2019-12-28 01:18:48,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 01:18:48,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:18:48,891 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:18:48,891 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:18:48,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:18:48,892 INFO L82 PathProgramCache]: Analyzing trace with hash 425705594, now seen corresponding path program 1 times [2019-12-28 01:18:48,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:18:48,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517503672] [2019-12-28 01:18:48,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:18:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:18:48,997 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 01:18:48,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517503672] [2019-12-28 01:18:48,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:18:48,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:18:48,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1423601814] [2019-12-28 01:18:48,999 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:18:49,005 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:18:49,011 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 55 states and 54 transitions. [2019-12-28 01:18:49,011 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:18:49,011 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:18:49,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:18:49,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:18:49,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:18:49,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:18:49,012 INFO L87 Difference]: Start difference. First operand 53490 states and 187734 transitions. Second operand 6 states. [2019-12-28 01:18:49,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:18:49,880 INFO L93 Difference]: Finished difference Result 67849 states and 231360 transitions. [2019-12-28 01:18:49,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:18:49,880 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-28 01:18:49,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:18:50,022 INFO L225 Difference]: With dead ends: 67849 [2019-12-28 01:18:50,022 INFO L226 Difference]: Without dead ends: 67849 [2019-12-28 01:18:50,023 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 01:18:50,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67849 states. [2019-12-28 01:18:53,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67849 to 59081. [2019-12-28 01:18:53,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59081 states. [2019-12-28 01:18:53,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59081 states to 59081 states and 204130 transitions. [2019-12-28 01:18:53,601 INFO L78 Accepts]: Start accepts. Automaton has 59081 states and 204130 transitions. Word has length 54 [2019-12-28 01:18:53,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:18:53,601 INFO L462 AbstractCegarLoop]: Abstraction has 59081 states and 204130 transitions. [2019-12-28 01:18:53,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:18:53,601 INFO L276 IsEmpty]: Start isEmpty. Operand 59081 states and 204130 transitions. [2019-12-28 01:18:53,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 01:18:53,611 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:18:53,611 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:18:53,612 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:18:53,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:18:53,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1313209275, now seen corresponding path program 1 times [2019-12-28 01:18:53,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:18:53,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139892474] [2019-12-28 01:18:53,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:18:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:18:53,688 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 01:18:53,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139892474] [2019-12-28 01:18:53,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:18:53,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:18:53,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [407624961] [2019-12-28 01:18:53,689 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:18:53,695 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:18:53,700 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 55 states and 54 transitions. [2019-12-28 01:18:53,700 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:18:53,701 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:18:53,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:18:53,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:18:53,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:18:53,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:18:53,702 INFO L87 Difference]: Start difference. First operand 59081 states and 204130 transitions. Second operand 4 states. [2019-12-28 01:18:53,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:18:53,760 INFO L93 Difference]: Finished difference Result 10212 states and 31246 transitions. [2019-12-28 01:18:53,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 01:18:53,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-28 01:18:53,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:18:53,777 INFO L225 Difference]: With dead ends: 10212 [2019-12-28 01:18:53,777 INFO L226 Difference]: Without dead ends: 8507 [2019-12-28 01:18:53,778 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 01:18:53,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8507 states. [2019-12-28 01:18:53,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8507 to 8459. [2019-12-28 01:18:53,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8459 states. [2019-12-28 01:18:53,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8459 states to 8459 states and 25325 transitions. [2019-12-28 01:18:53,884 INFO L78 Accepts]: Start accepts. Automaton has 8459 states and 25325 transitions. Word has length 54 [2019-12-28 01:18:53,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:18:53,884 INFO L462 AbstractCegarLoop]: Abstraction has 8459 states and 25325 transitions. [2019-12-28 01:18:53,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:18:53,885 INFO L276 IsEmpty]: Start isEmpty. Operand 8459 states and 25325 transitions. [2019-12-28 01:18:53,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-28 01:18:53,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:18:53,888 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] [2019-12-28 01:18:53,888 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:18:53,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:18:53,888 INFO L82 PathProgramCache]: Analyzing trace with hash 340486782, now seen corresponding path program 1 times [2019-12-28 01:18:53,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:18:53,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402628621] [2019-12-28 01:18:53,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:18:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:18:53,938 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 01:18:53,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402628621] [2019-12-28 01:18:53,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:18:53,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:18:53,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [541175309] [2019-12-28 01:18:53,939 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:18:53,949 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:18:53,959 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 61 transitions. [2019-12-28 01:18:53,959 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:18:53,959 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:18:53,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:18:53,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:18:53,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:18:53,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:18:53,960 INFO L87 Difference]: Start difference. First operand 8459 states and 25325 transitions. Second operand 4 states. [2019-12-28 01:18:54,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:18:54,079 INFO L93 Difference]: Finished difference Result 9706 states and 29104 transitions. [2019-12-28 01:18:54,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 01:18:54,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-28 01:18:54,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:18:54,098 INFO L225 Difference]: With dead ends: 9706 [2019-12-28 01:18:54,098 INFO L226 Difference]: Without dead ends: 9706 [2019-12-28 01:18:54,099 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 01:18:54,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9706 states. [2019-12-28 01:18:54,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9706 to 8879. [2019-12-28 01:18:54,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8879 states. [2019-12-28 01:18:54,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8879 states to 8879 states and 26588 transitions. [2019-12-28 01:18:54,268 INFO L78 Accepts]: Start accepts. Automaton has 8879 states and 26588 transitions. Word has length 61 [2019-12-28 01:18:54,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:18:54,268 INFO L462 AbstractCegarLoop]: Abstraction has 8879 states and 26588 transitions. [2019-12-28 01:18:54,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:18:54,269 INFO L276 IsEmpty]: Start isEmpty. Operand 8879 states and 26588 transitions. [2019-12-28 01:18:54,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-28 01:18:54,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:18:54,273 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] [2019-12-28 01:18:54,273 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:18:54,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:18:54,274 INFO L82 PathProgramCache]: Analyzing trace with hash 2083297117, now seen corresponding path program 1 times [2019-12-28 01:18:54,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:18:54,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568138522] [2019-12-28 01:18:54,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:18:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:18:54,348 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 01:18:54,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568138522] [2019-12-28 01:18:54,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:18:54,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:18:54,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [737134080] [2019-12-28 01:18:54,349 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:18:54,359 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:18:54,370 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 61 transitions. [2019-12-28 01:18:54,370 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:18:54,370 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:18:54,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:18:54,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:18:54,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:18:54,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:18:54,372 INFO L87 Difference]: Start difference. First operand 8879 states and 26588 transitions. Second operand 6 states. [2019-12-28 01:18:54,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:18:54,802 INFO L93 Difference]: Finished difference Result 11195 states and 33075 transitions. [2019-12-28 01:18:54,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 01:18:54,802 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-28 01:18:54,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:18:54,818 INFO L225 Difference]: With dead ends: 11195 [2019-12-28 01:18:54,819 INFO L226 Difference]: Without dead ends: 11134 [2019-12-28 01:18:54,819 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 01:18:54,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11134 states. [2019-12-28 01:18:54,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11134 to 10410. [2019-12-28 01:18:54,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10410 states. [2019-12-28 01:18:55,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10410 states to 10410 states and 30942 transitions. [2019-12-28 01:18:55,354 INFO L78 Accepts]: Start accepts. Automaton has 10410 states and 30942 transitions. Word has length 61 [2019-12-28 01:18:55,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:18:55,354 INFO L462 AbstractCegarLoop]: Abstraction has 10410 states and 30942 transitions. [2019-12-28 01:18:55,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:18:55,354 INFO L276 IsEmpty]: Start isEmpty. Operand 10410 states and 30942 transitions. [2019-12-28 01:18:55,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 01:18:55,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:18:55,360 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] [2019-12-28 01:18:55,360 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:18:55,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:18:55,360 INFO L82 PathProgramCache]: Analyzing trace with hash 429763341, now seen corresponding path program 1 times [2019-12-28 01:18:55,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:18:55,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986663526] [2019-12-28 01:18:55,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:18:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:18:55,415 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 01:18:55,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986663526] [2019-12-28 01:18:55,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:18:55,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:18:55,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [22274426] [2019-12-28 01:18:55,416 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:18:55,428 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:18:55,451 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 120 states and 171 transitions. [2019-12-28 01:18:55,451 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:18:55,561 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 01:18:55,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:18:55,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:18:55,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:18:55,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:18:55,562 INFO L87 Difference]: Start difference. First operand 10410 states and 30942 transitions. Second operand 6 states. [2019-12-28 01:18:56,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:18:56,208 INFO L93 Difference]: Finished difference Result 15178 states and 44225 transitions. [2019-12-28 01:18:56,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 01:18:56,208 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-28 01:18:56,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:18:56,285 INFO L225 Difference]: With dead ends: 15178 [2019-12-28 01:18:56,286 INFO L226 Difference]: Without dead ends: 15178 [2019-12-28 01:18:56,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:18:56,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15178 states. [2019-12-28 01:18:56,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15178 to 11727. [2019-12-28 01:18:56,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11727 states. [2019-12-28 01:18:56,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11727 states to 11727 states and 34516 transitions. [2019-12-28 01:18:56,622 INFO L78 Accepts]: Start accepts. Automaton has 11727 states and 34516 transitions. Word has length 67 [2019-12-28 01:18:56,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:18:56,622 INFO L462 AbstractCegarLoop]: Abstraction has 11727 states and 34516 transitions. [2019-12-28 01:18:56,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:18:56,622 INFO L276 IsEmpty]: Start isEmpty. Operand 11727 states and 34516 transitions. [2019-12-28 01:18:56,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 01:18:56,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:18:56,636 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] [2019-12-28 01:18:56,636 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:18:56,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:18:56,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1674527822, now seen corresponding path program 1 times [2019-12-28 01:18:56,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:18:56,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977975170] [2019-12-28 01:18:56,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:18:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:18:56,759 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 01:18:56,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977975170] [2019-12-28 01:18:56,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:18:56,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:18:56,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1621165990] [2019-12-28 01:18:56,760 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:18:56,772 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:18:56,796 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 120 states and 171 transitions. [2019-12-28 01:18:56,796 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:18:56,879 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 01:18:56,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 01:18:56,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:18:56,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 01:18:56,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:18:56,881 INFO L87 Difference]: Start difference. First operand 11727 states and 34516 transitions. Second operand 8 states. [2019-12-28 01:18:57,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:18:57,474 INFO L93 Difference]: Finished difference Result 12772 states and 36832 transitions. [2019-12-28 01:18:57,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 01:18:57,475 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-12-28 01:18:57,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:18:57,500 INFO L225 Difference]: With dead ends: 12772 [2019-12-28 01:18:57,500 INFO L226 Difference]: Without dead ends: 12772 [2019-12-28 01:18:57,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-12-28 01:18:57,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12772 states. [2019-12-28 01:18:57,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12772 to 11925. [2019-12-28 01:18:57,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11925 states. [2019-12-28 01:18:57,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11925 states to 11925 states and 34759 transitions. [2019-12-28 01:18:57,758 INFO L78 Accepts]: Start accepts. Automaton has 11925 states and 34759 transitions. Word has length 67 [2019-12-28 01:18:57,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:18:57,759 INFO L462 AbstractCegarLoop]: Abstraction has 11925 states and 34759 transitions. [2019-12-28 01:18:57,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 01:18:57,759 INFO L276 IsEmpty]: Start isEmpty. Operand 11925 states and 34759 transitions. [2019-12-28 01:18:57,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 01:18:57,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:18:57,770 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] [2019-12-28 01:18:57,770 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:18:57,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:18:57,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1885878735, now seen corresponding path program 1 times [2019-12-28 01:18:57,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:18:57,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146334330] [2019-12-28 01:18:57,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:18:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:18:57,880 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 01:18:57,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146334330] [2019-12-28 01:18:57,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:18:57,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:18:57,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [39596796] [2019-12-28 01:18:57,884 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:18:57,898 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:18:57,925 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 120 states and 171 transitions. [2019-12-28 01:18:57,925 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:18:57,942 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 01:18:57,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:18:57,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:18:57,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:18:57,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:18:57,943 INFO L87 Difference]: Start difference. First operand 11925 states and 34759 transitions. Second operand 6 states. [2019-12-28 01:18:58,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:18:58,352 INFO L93 Difference]: Finished difference Result 15220 states and 44029 transitions. [2019-12-28 01:18:58,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 01:18:58,352 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-28 01:18:58,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:18:58,379 INFO L225 Difference]: With dead ends: 15220 [2019-12-28 01:18:58,379 INFO L226 Difference]: Without dead ends: 15220 [2019-12-28 01:18:58,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:18:58,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15220 states. [2019-12-28 01:18:58,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15220 to 14156. [2019-12-28 01:18:58,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14156 states. [2019-12-28 01:18:58,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14156 states to 14156 states and 40894 transitions. [2019-12-28 01:18:58,677 INFO L78 Accepts]: Start accepts. Automaton has 14156 states and 40894 transitions. Word has length 67 [2019-12-28 01:18:58,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:18:58,677 INFO L462 AbstractCegarLoop]: Abstraction has 14156 states and 40894 transitions. [2019-12-28 01:18:58,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:18:58,678 INFO L276 IsEmpty]: Start isEmpty. Operand 14156 states and 40894 transitions. [2019-12-28 01:18:58,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 01:18:58,694 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:18:58,695 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] [2019-12-28 01:18:58,695 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:18:58,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:18:58,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1375344558, now seen corresponding path program 1 times [2019-12-28 01:18:58,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:18:58,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327218584] [2019-12-28 01:18:58,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:18:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:18:58,804 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 01:18:58,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327218584] [2019-12-28 01:18:58,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:18:58,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:18:58,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [896125870] [2019-12-28 01:18:58,807 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:18:58,851 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:18:58,902 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 120 states and 171 transitions. [2019-12-28 01:18:58,903 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:18:58,904 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:18:58,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:18:58,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:18:58,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:18:58,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:18:58,905 INFO L87 Difference]: Start difference. First operand 14156 states and 40894 transitions. Second operand 4 states. [2019-12-28 01:18:59,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:18:59,515 INFO L93 Difference]: Finished difference Result 17525 states and 50589 transitions. [2019-12-28 01:18:59,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 01:18:59,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-28 01:18:59,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:18:59,541 INFO L225 Difference]: With dead ends: 17525 [2019-12-28 01:18:59,541 INFO L226 Difference]: Without dead ends: 17354 [2019-12-28 01:18:59,541 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 01:18:59,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17354 states. [2019-12-28 01:19:00,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17354 to 16508. [2019-12-28 01:19:00,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16508 states. [2019-12-28 01:19:00,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16508 states to 16508 states and 47592 transitions. [2019-12-28 01:19:00,195 INFO L78 Accepts]: Start accepts. Automaton has 16508 states and 47592 transitions. Word has length 67 [2019-12-28 01:19:00,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:19:00,196 INFO L462 AbstractCegarLoop]: Abstraction has 16508 states and 47592 transitions. [2019-12-28 01:19:00,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:19:00,196 INFO L276 IsEmpty]: Start isEmpty. Operand 16508 states and 47592 transitions. [2019-12-28 01:19:00,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 01:19:00,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:19:00,207 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] [2019-12-28 01:19:00,207 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:19:00,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:19:00,208 INFO L82 PathProgramCache]: Analyzing trace with hash -421606801, now seen corresponding path program 1 times [2019-12-28 01:19:00,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:19:00,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375519374] [2019-12-28 01:19:00,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:19:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:19:00,368 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 01:19:00,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375519374] [2019-12-28 01:19:00,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:19:00,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:19:00,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1305137401] [2019-12-28 01:19:00,369 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:19:00,381 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:19:00,405 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 120 states and 171 transitions. [2019-12-28 01:19:00,406 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:19:00,483 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 01:19:00,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 01:19:00,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:19:00,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 01:19:00,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:19:00,484 INFO L87 Difference]: Start difference. First operand 16508 states and 47592 transitions. Second operand 9 states. [2019-12-28 01:19:01,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:19:01,152 INFO L93 Difference]: Finished difference Result 21898 states and 61512 transitions. [2019-12-28 01:19:01,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 01:19:01,152 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-28 01:19:01,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:19:01,181 INFO L225 Difference]: With dead ends: 21898 [2019-12-28 01:19:01,181 INFO L226 Difference]: Without dead ends: 21898 [2019-12-28 01:19:01,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-12-28 01:19:01,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21898 states. [2019-12-28 01:19:01,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21898 to 18377. [2019-12-28 01:19:01,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18377 states. [2019-12-28 01:19:01,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18377 states to 18377 states and 51655 transitions. [2019-12-28 01:19:01,436 INFO L78 Accepts]: Start accepts. Automaton has 18377 states and 51655 transitions. Word has length 67 [2019-12-28 01:19:01,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:19:01,437 INFO L462 AbstractCegarLoop]: Abstraction has 18377 states and 51655 transitions. [2019-12-28 01:19:01,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 01:19:01,437 INFO L276 IsEmpty]: Start isEmpty. Operand 18377 states and 51655 transitions. [2019-12-28 01:19:01,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 01:19:01,444 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:19:01,444 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] [2019-12-28 01:19:01,445 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:19:01,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:19:01,445 INFO L82 PathProgramCache]: Analyzing trace with hash 465896880, now seen corresponding path program 1 times [2019-12-28 01:19:01,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:19:01,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016348304] [2019-12-28 01:19:01,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:19:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:19:01,512 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 01:19:01,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016348304] [2019-12-28 01:19:01,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:19:01,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:19:01,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [845732114] [2019-12-28 01:19:01,513 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:19:01,523 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:19:01,546 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 120 states and 171 transitions. [2019-12-28 01:19:01,546 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:19:01,561 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 01:19:01,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:19:01,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:19:01,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:19:01,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:19:01,563 INFO L87 Difference]: Start difference. First operand 18377 states and 51655 transitions. Second operand 6 states. [2019-12-28 01:19:01,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:19:01,613 INFO L93 Difference]: Finished difference Result 5654 states and 13548 transitions. [2019-12-28 01:19:01,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 01:19:01,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-28 01:19:01,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:19:01,620 INFO L225 Difference]: With dead ends: 5654 [2019-12-28 01:19:01,621 INFO L226 Difference]: Without dead ends: 4682 [2019-12-28 01:19:01,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:19:01,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4682 states. [2019-12-28 01:19:01,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4682 to 3847. [2019-12-28 01:19:01,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3847 states. [2019-12-28 01:19:01,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3847 states to 3847 states and 9034 transitions. [2019-12-28 01:19:01,659 INFO L78 Accepts]: Start accepts. Automaton has 3847 states and 9034 transitions. Word has length 67 [2019-12-28 01:19:01,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:19:01,659 INFO L462 AbstractCegarLoop]: Abstraction has 3847 states and 9034 transitions. [2019-12-28 01:19:01,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:19:01,659 INFO L276 IsEmpty]: Start isEmpty. Operand 3847 states and 9034 transitions. [2019-12-28 01:19:01,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 01:19:01,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:19:01,662 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] [2019-12-28 01:19:01,662 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:19:01,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:19:01,662 INFO L82 PathProgramCache]: Analyzing trace with hash 2130159502, now seen corresponding path program 1 times [2019-12-28 01:19:01,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:19:01,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463368708] [2019-12-28 01:19:01,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:19:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:19:01,698 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 01:19:01,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463368708] [2019-12-28 01:19:01,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:19:01,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 01:19:01,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [945755328] [2019-12-28 01:19:01,699 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:19:01,710 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:19:01,724 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 67 transitions. [2019-12-28 01:19:01,724 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:19:01,725 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:19:01,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 01:19:01,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:19:01,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 01:19:01,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 01:19:01,726 INFO L87 Difference]: Start difference. First operand 3847 states and 9034 transitions. Second operand 3 states. [2019-12-28 01:19:01,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:19:01,758 INFO L93 Difference]: Finished difference Result 4819 states and 11125 transitions. [2019-12-28 01:19:01,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 01:19:01,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-28 01:19:01,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:19:01,764 INFO L225 Difference]: With dead ends: 4819 [2019-12-28 01:19:01,765 INFO L226 Difference]: Without dead ends: 4819 [2019-12-28 01:19:01,765 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 01:19:01,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4819 states. [2019-12-28 01:19:01,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4819 to 3790. [2019-12-28 01:19:01,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3790 states. [2019-12-28 01:19:01,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3790 states to 3790 states and 8687 transitions. [2019-12-28 01:19:01,803 INFO L78 Accepts]: Start accepts. Automaton has 3790 states and 8687 transitions. Word has length 67 [2019-12-28 01:19:01,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:19:01,804 INFO L462 AbstractCegarLoop]: Abstraction has 3790 states and 8687 transitions. [2019-12-28 01:19:01,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 01:19:01,804 INFO L276 IsEmpty]: Start isEmpty. Operand 3790 states and 8687 transitions. [2019-12-28 01:19:01,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-28 01:19:01,807 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:19:01,808 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] [2019-12-28 01:19:01,808 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:19:01,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:19:01,808 INFO L82 PathProgramCache]: Analyzing trace with hash -347462239, now seen corresponding path program 1 times [2019-12-28 01:19:01,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:19:01,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871955936] [2019-12-28 01:19:01,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:19:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:19:01,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 01:19:01,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871955936] [2019-12-28 01:19:01,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:19:01,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:19:01,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1556351127] [2019-12-28 01:19:01,862 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:19:01,875 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:19:01,894 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 73 transitions. [2019-12-28 01:19:01,895 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:19:01,895 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:19:01,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:19:01,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:19:01,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:19:01,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:19:01,896 INFO L87 Difference]: Start difference. First operand 3790 states and 8687 transitions. Second operand 5 states. [2019-12-28 01:19:02,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:19:02,062 INFO L93 Difference]: Finished difference Result 4737 states and 10904 transitions. [2019-12-28 01:19:02,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 01:19:02,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-12-28 01:19:02,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:19:02,069 INFO L225 Difference]: With dead ends: 4737 [2019-12-28 01:19:02,069 INFO L226 Difference]: Without dead ends: 4737 [2019-12-28 01:19:02,069 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 01:19:02,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4737 states. [2019-12-28 01:19:02,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4737 to 4176. [2019-12-28 01:19:02,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4176 states. [2019-12-28 01:19:02,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 9598 transitions. [2019-12-28 01:19:02,113 INFO L78 Accepts]: Start accepts. Automaton has 4176 states and 9598 transitions. Word has length 73 [2019-12-28 01:19:02,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:19:02,113 INFO L462 AbstractCegarLoop]: Abstraction has 4176 states and 9598 transitions. [2019-12-28 01:19:02,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:19:02,113 INFO L276 IsEmpty]: Start isEmpty. Operand 4176 states and 9598 transitions. [2019-12-28 01:19:02,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-28 01:19:02,117 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:19:02,117 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] [2019-12-28 01:19:02,117 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:19:02,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:19:02,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1395348096, now seen corresponding path program 1 times [2019-12-28 01:19:02,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:19:02,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315653005] [2019-12-28 01:19:02,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:19:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:19:02,180 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 01:19:02,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315653005] [2019-12-28 01:19:02,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:19:02,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:19:02,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2029102923] [2019-12-28 01:19:02,181 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:19:02,195 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:19:02,215 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 73 transitions. [2019-12-28 01:19:02,215 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:19:02,215 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:19:02,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 01:19:02,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:19:02,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 01:19:02,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:19:02,217 INFO L87 Difference]: Start difference. First operand 4176 states and 9598 transitions. Second operand 7 states. [2019-12-28 01:19:02,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:19:02,722 INFO L93 Difference]: Finished difference Result 4873 states and 11063 transitions. [2019-12-28 01:19:02,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 01:19:02,722 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-12-28 01:19:02,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:19:02,729 INFO L225 Difference]: With dead ends: 4873 [2019-12-28 01:19:02,729 INFO L226 Difference]: Without dead ends: 4820 [2019-12-28 01:19:02,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-28 01:19:02,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4820 states. [2019-12-28 01:19:02,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4820 to 4234. [2019-12-28 01:19:02,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4234 states. [2019-12-28 01:19:02,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4234 states to 4234 states and 9647 transitions. [2019-12-28 01:19:02,796 INFO L78 Accepts]: Start accepts. Automaton has 4234 states and 9647 transitions. Word has length 73 [2019-12-28 01:19:02,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:19:02,796 INFO L462 AbstractCegarLoop]: Abstraction has 4234 states and 9647 transitions. [2019-12-28 01:19:02,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 01:19:02,796 INFO L276 IsEmpty]: Start isEmpty. Operand 4234 states and 9647 transitions. [2019-12-28 01:19:02,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-28 01:19:02,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:19:02,803 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:19:02,803 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:19:02,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:19:02,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1966822310, now seen corresponding path program 1 times [2019-12-28 01:19:02,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:19:02,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359734095] [2019-12-28 01:19:02,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:19:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:19:02,853 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 01:19:02,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359734095] [2019-12-28 01:19:02,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:19:02,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 01:19:02,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1029124466] [2019-12-28 01:19:02,856 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:19:02,884 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:19:03,260 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 185 states and 274 transitions. [2019-12-28 01:19:03,260 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:19:03,263 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 01:19:03,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 01:19:03,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:19:03,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 01:19:03,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 01:19:03,267 INFO L87 Difference]: Start difference. First operand 4234 states and 9647 transitions. Second operand 3 states. [2019-12-28 01:19:03,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:19:03,429 INFO L93 Difference]: Finished difference Result 5804 states and 12895 transitions. [2019-12-28 01:19:03,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 01:19:03,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-12-28 01:19:03,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:19:03,437 INFO L225 Difference]: With dead ends: 5804 [2019-12-28 01:19:03,437 INFO L226 Difference]: Without dead ends: 5513 [2019-12-28 01:19:03,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 01:19:03,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5513 states. [2019-12-28 01:19:03,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5513 to 5040. [2019-12-28 01:19:03,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5040 states. [2019-12-28 01:19:03,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5040 states to 5040 states and 11341 transitions. [2019-12-28 01:19:03,484 INFO L78 Accepts]: Start accepts. Automaton has 5040 states and 11341 transitions. Word has length 94 [2019-12-28 01:19:03,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:19:03,485 INFO L462 AbstractCegarLoop]: Abstraction has 5040 states and 11341 transitions. [2019-12-28 01:19:03,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 01:19:03,485 INFO L276 IsEmpty]: Start isEmpty. Operand 5040 states and 11341 transitions. [2019-12-28 01:19:03,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-28 01:19:03,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:19:03,489 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:19:03,490 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:19:03,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:19:03,490 INFO L82 PathProgramCache]: Analyzing trace with hash -2044994522, now seen corresponding path program 1 times [2019-12-28 01:19:03,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:19:03,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251454967] [2019-12-28 01:19:03,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:19:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:19:03,555 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 01:19:03,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251454967] [2019-12-28 01:19:03,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:19:03,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:19:03,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1314525396] [2019-12-28 01:19:03,556 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:19:03,580 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:19:03,664 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 185 states and 274 transitions. [2019-12-28 01:19:03,664 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:19:03,666 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 01:19:03,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:19:03,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:19:03,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:19:03,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:19:03,666 INFO L87 Difference]: Start difference. First operand 5040 states and 11341 transitions. Second operand 4 states. [2019-12-28 01:19:03,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:19:03,757 INFO L93 Difference]: Finished difference Result 5316 states and 12003 transitions. [2019-12-28 01:19:03,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 01:19:03,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-12-28 01:19:03,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:19:03,763 INFO L225 Difference]: With dead ends: 5316 [2019-12-28 01:19:03,763 INFO L226 Difference]: Without dead ends: 5316 [2019-12-28 01:19:03,763 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 01:19:03,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5316 states. [2019-12-28 01:19:03,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5316 to 4773. [2019-12-28 01:19:03,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4773 states. [2019-12-28 01:19:03,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4773 states to 4773 states and 10838 transitions. [2019-12-28 01:19:03,810 INFO L78 Accepts]: Start accepts. Automaton has 4773 states and 10838 transitions. Word has length 94 [2019-12-28 01:19:03,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:19:03,810 INFO L462 AbstractCegarLoop]: Abstraction has 4773 states and 10838 transitions. [2019-12-28 01:19:03,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:19:03,810 INFO L276 IsEmpty]: Start isEmpty. Operand 4773 states and 10838 transitions. [2019-12-28 01:19:03,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 01:19:03,814 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:19:03,815 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:19:03,815 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:19:03,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:19:03,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1707183412, now seen corresponding path program 1 times [2019-12-28 01:19:03,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:19:03,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22466585] [2019-12-28 01:19:03,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:19:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:19:03,886 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 01:19:03,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22466585] [2019-12-28 01:19:03,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:19:03,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:19:03,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1361882126] [2019-12-28 01:19:03,887 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:19:03,911 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:19:04,020 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 280 transitions. [2019-12-28 01:19:04,021 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:19:04,022 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 01:19:04,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:19:04,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:19:04,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:19:04,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:19:04,023 INFO L87 Difference]: Start difference. First operand 4773 states and 10838 transitions. Second operand 5 states. [2019-12-28 01:19:04,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:19:04,132 INFO L93 Difference]: Finished difference Result 5452 states and 12346 transitions. [2019-12-28 01:19:04,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 01:19:04,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-28 01:19:04,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:19:04,140 INFO L225 Difference]: With dead ends: 5452 [2019-12-28 01:19:04,140 INFO L226 Difference]: Without dead ends: 5452 [2019-12-28 01:19:04,140 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 01:19:04,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5452 states. [2019-12-28 01:19:04,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5452 to 4174. [2019-12-28 01:19:04,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4174 states. [2019-12-28 01:19:04,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 9445 transitions. [2019-12-28 01:19:04,203 INFO L78 Accepts]: Start accepts. Automaton has 4174 states and 9445 transitions. Word has length 96 [2019-12-28 01:19:04,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:19:04,203 INFO L462 AbstractCegarLoop]: Abstraction has 4174 states and 9445 transitions. [2019-12-28 01:19:04,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:19:04,204 INFO L276 IsEmpty]: Start isEmpty. Operand 4174 states and 9445 transitions. [2019-12-28 01:19:04,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 01:19:04,209 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:19:04,210 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:19:04,210 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:19:04,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:19:04,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1695867285, now seen corresponding path program 1 times [2019-12-28 01:19:04,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:19:04,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388405377] [2019-12-28 01:19:04,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:19:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:19:04,277 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 01:19:04,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388405377] [2019-12-28 01:19:04,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:19:04,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:19:04,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1766353283] [2019-12-28 01:19:04,278 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:19:04,302 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:19:04,428 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 280 transitions. [2019-12-28 01:19:04,428 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:19:04,433 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 01:19:04,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:19:04,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:19:04,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:19:04,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:19:04,435 INFO L87 Difference]: Start difference. First operand 4174 states and 9445 transitions. Second operand 4 states. [2019-12-28 01:19:04,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:19:04,694 INFO L93 Difference]: Finished difference Result 4884 states and 10994 transitions. [2019-12-28 01:19:04,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 01:19:04,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-28 01:19:04,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:19:04,701 INFO L225 Difference]: With dead ends: 4884 [2019-12-28 01:19:04,701 INFO L226 Difference]: Without dead ends: 4828 [2019-12-28 01:19:04,701 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 01:19:04,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4828 states. [2019-12-28 01:19:04,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4828 to 4625. [2019-12-28 01:19:04,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4625 states. [2019-12-28 01:19:04,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4625 states to 4625 states and 10444 transitions. [2019-12-28 01:19:04,749 INFO L78 Accepts]: Start accepts. Automaton has 4625 states and 10444 transitions. Word has length 96 [2019-12-28 01:19:04,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:19:04,749 INFO L462 AbstractCegarLoop]: Abstraction has 4625 states and 10444 transitions. [2019-12-28 01:19:04,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:19:04,749 INFO L276 IsEmpty]: Start isEmpty. Operand 4625 states and 10444 transitions. [2019-12-28 01:19:04,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 01:19:04,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:19:04,754 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:19:04,754 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:19:04,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:19:04,755 INFO L82 PathProgramCache]: Analyzing trace with hash 521890668, now seen corresponding path program 1 times [2019-12-28 01:19:04,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:19:04,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674725486] [2019-12-28 01:19:04,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:19:04,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:19:04,930 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 01:19:04,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674725486] [2019-12-28 01:19:04,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:19:04,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 01:19:04,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1153900695] [2019-12-28 01:19:04,932 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:19:04,958 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:19:05,073 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 280 transitions. [2019-12-28 01:19:05,073 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:19:05,327 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-28 01:19:05,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-28 01:19:05,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:19:05,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-28 01:19:05,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-12-28 01:19:05,331 INFO L87 Difference]: Start difference. First operand 4625 states and 10444 transitions. Second operand 14 states. [2019-12-28 01:19:06,991 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-12-28 01:19:08,449 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-12-28 01:19:10,809 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-12-28 01:19:11,242 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-12-28 01:19:12,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:19:12,283 INFO L93 Difference]: Finished difference Result 8667 states and 19207 transitions. [2019-12-28 01:19:12,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-12-28 01:19:12,284 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2019-12-28 01:19:12,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:19:12,296 INFO L225 Difference]: With dead ends: 8667 [2019-12-28 01:19:12,296 INFO L226 Difference]: Without dead ends: 8667 [2019-12-28 01:19:12,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 17 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1328 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=688, Invalid=3472, Unknown=0, NotChecked=0, Total=4160 [2019-12-28 01:19:12,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8667 states. [2019-12-28 01:19:12,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8667 to 5107. [2019-12-28 01:19:12,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5107 states. [2019-12-28 01:19:12,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5107 states to 5107 states and 11442 transitions. [2019-12-28 01:19:12,381 INFO L78 Accepts]: Start accepts. Automaton has 5107 states and 11442 transitions. Word has length 96 [2019-12-28 01:19:12,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:19:12,381 INFO L462 AbstractCegarLoop]: Abstraction has 5107 states and 11442 transitions. [2019-12-28 01:19:12,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-28 01:19:12,381 INFO L276 IsEmpty]: Start isEmpty. Operand 5107 states and 11442 transitions. [2019-12-28 01:19:12,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 01:19:12,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:19:12,388 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:19:12,388 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:19:12,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:19:12,389 INFO L82 PathProgramCache]: Analyzing trace with hash 733241581, now seen corresponding path program 1 times [2019-12-28 01:19:12,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:19:12,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912076361] [2019-12-28 01:19:12,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:19:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:19:12,506 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 01:19:12,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912076361] [2019-12-28 01:19:12,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:19:12,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:19:12,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2107099859] [2019-12-28 01:19:12,507 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:19:12,523 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:19:12,612 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 280 transitions. [2019-12-28 01:19:12,612 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:19:12,612 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:19:12,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:19:12,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:19:12,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:19:12,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:19:12,613 INFO L87 Difference]: Start difference. First operand 5107 states and 11442 transitions. Second operand 5 states. [2019-12-28 01:19:12,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:19:12,657 INFO L93 Difference]: Finished difference Result 5107 states and 11433 transitions. [2019-12-28 01:19:12,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 01:19:12,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-28 01:19:12,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:19:12,663 INFO L225 Difference]: With dead ends: 5107 [2019-12-28 01:19:12,664 INFO L226 Difference]: Without dead ends: 5107 [2019-12-28 01:19:12,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:19:12,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5107 states. [2019-12-28 01:19:12,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5107 to 4871. [2019-12-28 01:19:12,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4871 states. [2019-12-28 01:19:12,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4871 states to 4871 states and 10906 transitions. [2019-12-28 01:19:12,713 INFO L78 Accepts]: Start accepts. Automaton has 4871 states and 10906 transitions. Word has length 96 [2019-12-28 01:19:12,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:19:12,713 INFO L462 AbstractCegarLoop]: Abstraction has 4871 states and 10906 transitions. [2019-12-28 01:19:12,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:19:12,713 INFO L276 IsEmpty]: Start isEmpty. Operand 4871 states and 10906 transitions. [2019-12-28 01:19:12,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 01:19:12,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:19:12,719 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:19:12,719 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:19:12,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:19:12,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1620745262, now seen corresponding path program 1 times [2019-12-28 01:19:12,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:19:12,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177626888] [2019-12-28 01:19:12,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:19:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:19:12,840 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 01:19:12,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177626888] [2019-12-28 01:19:12,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:19:12,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-28 01:19:12,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [945452684] [2019-12-28 01:19:12,841 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:19:12,853 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:19:12,936 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 280 transitions. [2019-12-28 01:19:12,937 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:19:12,985 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 01:19:12,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-28 01:19:12,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:19:12,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-28 01:19:12,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-12-28 01:19:12,986 INFO L87 Difference]: Start difference. First operand 4871 states and 10906 transitions. Second operand 12 states. [2019-12-28 01:19:15,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:19:15,114 INFO L93 Difference]: Finished difference Result 19778 states and 43760 transitions. [2019-12-28 01:19:15,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-28 01:19:15,115 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-28 01:19:15,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:19:15,128 INFO L225 Difference]: With dead ends: 19778 [2019-12-28 01:19:15,129 INFO L226 Difference]: Without dead ends: 12483 [2019-12-28 01:19:15,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=765, Unknown=0, NotChecked=0, Total=930 [2019-12-28 01:19:15,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12483 states. [2019-12-28 01:19:15,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12483 to 4967. [2019-12-28 01:19:15,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4967 states. [2019-12-28 01:19:15,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4967 states to 4967 states and 10989 transitions. [2019-12-28 01:19:15,212 INFO L78 Accepts]: Start accepts. Automaton has 4967 states and 10989 transitions. Word has length 96 [2019-12-28 01:19:15,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:19:15,213 INFO L462 AbstractCegarLoop]: Abstraction has 4967 states and 10989 transitions. [2019-12-28 01:19:15,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-28 01:19:15,213 INFO L276 IsEmpty]: Start isEmpty. Operand 4967 states and 10989 transitions. [2019-12-28 01:19:15,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 01:19:15,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:19:15,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, 1, 1, 1, 1, 1, 1, 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 01:19:15,217 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:19:15,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:19:15,218 INFO L82 PathProgramCache]: Analyzing trace with hash -393959572, now seen corresponding path program 2 times [2019-12-28 01:19:15,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:19:15,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033987328] [2019-12-28 01:19:15,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:19:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 01:19:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 01:19:15,301 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 01:19:15,301 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 01:19:15,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 01:19:15 BasicIcfg [2019-12-28 01:19:15,477 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 01:19:15,478 INFO L168 Benchmark]: Toolchain (without parser) took 65539.89 ms. Allocated memory was 137.4 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 100.1 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 806.7 MB. Max. memory is 7.1 GB. [2019-12-28 01:19:15,479 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-28 01:19:15,479 INFO L168 Benchmark]: CACSL2BoogieTranslator took 849.72 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 99.9 MB in the beginning and 154.0 MB in the end (delta: -54.1 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-28 01:19:15,480 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.53 ms. Allocated memory is still 201.9 MB. Free memory was 154.0 MB in the beginning and 151.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-28 01:19:15,480 INFO L168 Benchmark]: Boogie Preprocessor took 43.51 ms. Allocated memory is still 201.9 MB. Free memory was 151.3 MB in the beginning and 149.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-28 01:19:15,481 INFO L168 Benchmark]: RCFGBuilder took 833.69 ms. Allocated memory is still 201.9 MB. Free memory was 149.2 MB in the beginning and 104.8 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2019-12-28 01:19:15,481 INFO L168 Benchmark]: TraceAbstraction took 63722.12 ms. Allocated memory was 201.9 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 104.1 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 746.2 MB. Max. memory is 7.1 GB. [2019-12-28 01:19:15,483 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.13 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 849.72 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 99.9 MB in the beginning and 154.0 MB in the end (delta: -54.1 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 84.53 ms. Allocated memory is still 201.9 MB. Free memory was 154.0 MB in the beginning and 151.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.51 ms. Allocated memory is still 201.9 MB. Free memory was 151.3 MB in the beginning and 149.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 833.69 ms. Allocated memory is still 201.9 MB. Free memory was 149.2 MB in the beginning and 104.8 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 63722.12 ms. Allocated memory was 201.9 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 104.1 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 746.2 MB. 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] [L698] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L704] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L705] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L706] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L707] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L708] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L709] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L710] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L711] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L712] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L713] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L714] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L715] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L716] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L717] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L718] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] 0 pthread_t t595; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] FCALL, FORK 0 pthread_create(&t595, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L730] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L731] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L732] 1 y$r_buff0_thd1 = (_Bool)1 [L735] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L738] 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, __unbuffered_p1_EBX=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] [L798] 0 pthread_t t596; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L799] FCALL, FORK 0 pthread_create(&t596, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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] [L762] 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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] [L738] 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) [L739] 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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] [L762] 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) [L763] 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_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=1, y$w_buff1=0, y$w_buff1_used=0] [L763] 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)) [L764] 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_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=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 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)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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] [L740] 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 [L741] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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] [L741] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L742] 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=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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] [L742] 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 [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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 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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_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] [L765] 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)) [L766] 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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_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] [L766] 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)) [L767] 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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_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] [L767] 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)) [L768] 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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_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] [L768] 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)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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] [L770] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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] [L770] 2 y = y$flush_delayed ? y$mem_tmp : y [L771] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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] [L774] 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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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] [L774] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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] [L774] 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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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] [L774] 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) [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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] [L776] 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 [L777] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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] [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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] [L778] 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 [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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] [L805] 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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] [L805] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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] [L805] 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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] [L805] 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) [L806] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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] [L807] 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 [L808] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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] [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L809] 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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] [L809] 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 [L812] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 63.3s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 27.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8315 SDtfs, 10055 SDslu, 21065 SDs, 0 SdLazy, 10114 SolverSat, 498 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 387 GetRequests, 129 SyntacticMatches, 21 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1599 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71012occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 27.5s AutomataMinimizationTime, 29 MinimizatonAttempts, 94059 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 2050 NumberOfCodeBlocks, 2050 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1925 ConstructedInterpolants, 0 QuantifiedInterpolants, 353119 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...