/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/mix009_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 00:27:22,562 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 00:27:22,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 00:27:22,585 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 00:27:22,586 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 00:27:22,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 00:27:22,590 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 00:27:22,592 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 00:27:22,593 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 00:27:22,594 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 00:27:22,595 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 00:27:22,596 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 00:27:22,596 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 00:27:22,597 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 00:27:22,598 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 00:27:22,599 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 00:27:22,600 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 00:27:22,601 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 00:27:22,603 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 00:27:22,606 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 00:27:22,608 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 00:27:22,609 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 00:27:22,611 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 00:27:22,612 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 00:27:22,615 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 00:27:22,615 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 00:27:22,615 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 00:27:22,618 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 00:27:22,620 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 00:27:22,622 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 00:27:22,622 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 00:27:22,625 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 00:27:22,626 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 00:27:22,627 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 00:27:22,630 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 00:27:22,631 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 00:27:22,631 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 00:27:22,631 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 00:27:22,633 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 00:27:22,636 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 00:27:22,636 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 00:27:22,638 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 00:27:22,660 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 00:27:22,660 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 00:27:22,661 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 00:27:22,662 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 00:27:22,662 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 00:27:22,662 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 00:27:22,662 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 00:27:22,662 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 00:27:22,662 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 00:27:22,663 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 00:27:22,665 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 00:27:22,665 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 00:27:22,665 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 00:27:22,665 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 00:27:22,666 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 00:27:22,666 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 00:27:22,666 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 00:27:22,666 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 00:27:22,667 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 00:27:22,667 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 00:27:22,667 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 00:27:22,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 00:27:22,667 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 00:27:22,668 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 00:27:22,668 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 00:27:22,668 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 00:27:22,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 00:27:22,668 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 00:27:22,668 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 00:27:22,669 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 00:27:22,669 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 00:27:22,669 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 00:27:22,959 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 00:27:22,972 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 00:27:22,975 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 00:27:22,976 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 00:27:22,976 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 00:27:22,977 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix009_tso.opt.i [2019-12-28 00:27:23,043 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/928b0941d/86dc13ff7b4c4829975c035522696027/FLAG2df541f63 [2019-12-28 00:27:23,564 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 00:27:23,565 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009_tso.opt.i [2019-12-28 00:27:23,592 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/928b0941d/86dc13ff7b4c4829975c035522696027/FLAG2df541f63 [2019-12-28 00:27:23,849 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/928b0941d/86dc13ff7b4c4829975c035522696027 [2019-12-28 00:27:23,860 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 00:27:23,862 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 00:27:23,863 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 00:27:23,864 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 00:27:23,867 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 00:27:23,868 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 12:27:23" (1/1) ... [2019-12-28 00:27:23,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@166c5411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:27:23, skipping insertion in model container [2019-12-28 00:27:23,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 12:27:23" (1/1) ... [2019-12-28 00:27:23,879 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 00:27:23,938 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 00:27:24,492 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 00:27:24,504 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 00:27:24,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 00:27:24,674 INFO L208 MainTranslator]: Completed translation [2019-12-28 00:27:24,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:27:24 WrapperNode [2019-12-28 00:27:24,675 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 00:27:24,676 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 00:27:24,676 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 00:27:24,676 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 00:27:24,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:27:24" (1/1) ... [2019-12-28 00:27:24,704 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:27:24" (1/1) ... [2019-12-28 00:27:24,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 00:27:24,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 00:27:24,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 00:27:24,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 00:27:24,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:27:24" (1/1) ... [2019-12-28 00:27:24,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:27:24" (1/1) ... [2019-12-28 00:27:24,752 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:27:24" (1/1) ... [2019-12-28 00:27:24,752 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:27:24" (1/1) ... [2019-12-28 00:27:24,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:27:24" (1/1) ... [2019-12-28 00:27:24,768 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:27:24" (1/1) ... [2019-12-28 00:27:24,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:27:24" (1/1) ... [2019-12-28 00:27:24,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 00:27:24,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 00:27:24,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 00:27:24,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 00:27:24,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:27:24" (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 00:27:24,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 00:27:24,854 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 00:27:24,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 00:27:24,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 00:27:24,855 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 00:27:24,855 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 00:27:24,855 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 00:27:24,856 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 00:27:24,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 00:27:24,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 00:27:24,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 00:27:24,860 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 00:27:25,837 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 00:27:25,838 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 00:27:25,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 12:27:25 BoogieIcfgContainer [2019-12-28 00:27:25,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 00:27:25,841 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 00:27:25,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 00:27:25,844 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 00:27:25,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 12:27:23" (1/3) ... [2019-12-28 00:27:25,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5feaccd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 12:27:25, skipping insertion in model container [2019-12-28 00:27:25,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:27:24" (2/3) ... [2019-12-28 00:27:25,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5feaccd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 12:27:25, skipping insertion in model container [2019-12-28 00:27:25,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 12:27:25" (3/3) ... [2019-12-28 00:27:25,848 INFO L109 eAbstractionObserver]: Analyzing ICFG mix009_tso.opt.i [2019-12-28 00:27:25,858 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 00:27:25,859 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 00:27:25,867 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 00:27:25,868 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 00:27:25,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,928 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,928 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,965 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,965 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,966 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,966 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,967 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:25,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,011 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,013 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,036 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,038 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,040 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:27:26,058 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 00:27:26,081 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 00:27:26,081 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 00:27:26,081 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 00:27:26,081 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 00:27:26,081 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 00:27:26,082 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 00:27:26,082 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 00:27:26,082 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 00:27:26,100 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 180 places, 229 transitions [2019-12-28 00:27:34,036 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80074 states. [2019-12-28 00:27:34,038 INFO L276 IsEmpty]: Start isEmpty. Operand 80074 states. [2019-12-28 00:27:34,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-28 00:27:34,048 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:27:34,049 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:27:34,050 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:27:34,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:27:34,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1419186758, now seen corresponding path program 1 times [2019-12-28 00:27:34,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:27:34,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776354073] [2019-12-28 00:27:34,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:27:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:27:34,399 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 00:27:34,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776354073] [2019-12-28 00:27:34,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:27:34,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 00:27:34,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1686891022] [2019-12-28 00:27:34,404 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:27:34,412 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:27:34,441 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 41 transitions. [2019-12-28 00:27:34,441 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:27:34,445 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:27:34,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 00:27:34,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:27:34,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 00:27:34,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 00:27:34,457 INFO L87 Difference]: Start difference. First operand 80074 states. Second operand 4 states. [2019-12-28 00:27:36,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:27:36,628 INFO L93 Difference]: Finished difference Result 80714 states and 324639 transitions. [2019-12-28 00:27:36,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 00:27:36,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-28 00:27:36,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:27:37,068 INFO L225 Difference]: With dead ends: 80714 [2019-12-28 00:27:37,068 INFO L226 Difference]: Without dead ends: 59002 [2019-12-28 00:27:37,071 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 00:27:40,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59002 states. [2019-12-28 00:27:41,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59002 to 59002. [2019-12-28 00:27:41,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59002 states. [2019-12-28 00:27:44,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59002 states to 59002 states and 240127 transitions. [2019-12-28 00:27:44,244 INFO L78 Accepts]: Start accepts. Automaton has 59002 states and 240127 transitions. Word has length 41 [2019-12-28 00:27:44,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:27:44,245 INFO L462 AbstractCegarLoop]: Abstraction has 59002 states and 240127 transitions. [2019-12-28 00:27:44,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 00:27:44,245 INFO L276 IsEmpty]: Start isEmpty. Operand 59002 states and 240127 transitions. [2019-12-28 00:27:44,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-28 00:27:44,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:27:44,267 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 00:27:44,267 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:27:44,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:27:44,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1596822137, now seen corresponding path program 1 times [2019-12-28 00:27:44,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:27:44,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953143497] [2019-12-28 00:27:44,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:27:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:27:44,395 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 00:27:44,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953143497] [2019-12-28 00:27:44,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:27:44,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:27:44,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1825185770] [2019-12-28 00:27:44,396 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:27:44,401 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:27:44,405 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 49 transitions. [2019-12-28 00:27:44,405 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:27:44,405 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:27:44,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 00:27:44,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:27:44,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 00:27:44,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:27:44,408 INFO L87 Difference]: Start difference. First operand 59002 states and 240127 transitions. Second operand 5 states. [2019-12-28 00:27:45,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:27:45,627 INFO L93 Difference]: Finished difference Result 95596 states and 363718 transitions. [2019-12-28 00:27:45,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 00:27:45,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-28 00:27:45,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:27:46,237 INFO L225 Difference]: With dead ends: 95596 [2019-12-28 00:27:46,238 INFO L226 Difference]: Without dead ends: 95044 [2019-12-28 00:27:46,238 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 00:27:47,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95044 states. [2019-12-28 00:27:52,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95044 to 93166. [2019-12-28 00:27:52,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93166 states. [2019-12-28 00:27:52,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93166 states to 93166 states and 356304 transitions. [2019-12-28 00:27:52,608 INFO L78 Accepts]: Start accepts. Automaton has 93166 states and 356304 transitions. Word has length 49 [2019-12-28 00:27:52,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:27:52,609 INFO L462 AbstractCegarLoop]: Abstraction has 93166 states and 356304 transitions. [2019-12-28 00:27:52,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 00:27:52,609 INFO L276 IsEmpty]: Start isEmpty. Operand 93166 states and 356304 transitions. [2019-12-28 00:27:52,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-28 00:27:52,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:27:52,615 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:27:52,615 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:27:52,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:27:52,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1178649803, now seen corresponding path program 1 times [2019-12-28 00:27:52,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:27:52,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138757199] [2019-12-28 00:27:52,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:27:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:27:52,729 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 00:27:52,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138757199] [2019-12-28 00:27:52,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:27:52,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:27:52,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [371366455] [2019-12-28 00:27:52,732 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:27:52,737 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:27:52,746 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 122 transitions. [2019-12-28 00:27:52,746 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:27:52,830 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 00:27:52,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 00:27:52,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:27:52,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 00:27:52,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 00:27:52,831 INFO L87 Difference]: Start difference. First operand 93166 states and 356304 transitions. Second operand 6 states. [2019-12-28 00:27:56,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:27:56,913 INFO L93 Difference]: Finished difference Result 118510 states and 442885 transitions. [2019-12-28 00:27:56,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 00:27:56,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-12-28 00:27:56,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:27:57,422 INFO L225 Difference]: With dead ends: 118510 [2019-12-28 00:27:57,423 INFO L226 Difference]: Without dead ends: 118062 [2019-12-28 00:27:57,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-28 00:27:58,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118062 states. [2019-12-28 00:28:00,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118062 to 104155. [2019-12-28 00:28:00,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104155 states. [2019-12-28 00:28:01,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104155 states to 104155 states and 394238 transitions. [2019-12-28 00:28:01,779 INFO L78 Accepts]: Start accepts. Automaton has 104155 states and 394238 transitions. Word has length 50 [2019-12-28 00:28:01,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:28:01,780 INFO L462 AbstractCegarLoop]: Abstraction has 104155 states and 394238 transitions. [2019-12-28 00:28:01,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 00:28:01,780 INFO L276 IsEmpty]: Start isEmpty. Operand 104155 states and 394238 transitions. [2019-12-28 00:28:01,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-28 00:28:01,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:28:01,793 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:28:01,793 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:28:01,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:28:01,794 INFO L82 PathProgramCache]: Analyzing trace with hash -305372623, now seen corresponding path program 1 times [2019-12-28 00:28:01,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:28:01,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421367991] [2019-12-28 00:28:01,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:28:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:28:01,868 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 00:28:01,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421367991] [2019-12-28 00:28:01,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:28:01,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 00:28:01,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1308928356] [2019-12-28 00:28:01,870 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:28:01,876 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:28:01,887 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 97 states and 140 transitions. [2019-12-28 00:28:01,887 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:28:01,932 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 00:28:01,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 00:28:01,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:28:01,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 00:28:01,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:28:01,933 INFO L87 Difference]: Start difference. First operand 104155 states and 394238 transitions. Second operand 5 states. [2019-12-28 00:28:06,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:28:06,970 INFO L93 Difference]: Finished difference Result 170913 states and 627060 transitions. [2019-12-28 00:28:06,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 00:28:06,971 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-28 00:28:06,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:28:07,390 INFO L225 Difference]: With dead ends: 170913 [2019-12-28 00:28:07,390 INFO L226 Difference]: Without dead ends: 170913 [2019-12-28 00:28:07,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:28:09,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170913 states. [2019-12-28 00:28:11,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170913 to 157191. [2019-12-28 00:28:11,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157191 states. [2019-12-28 00:28:12,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157191 states to 157191 states and 581292 transitions. [2019-12-28 00:28:12,133 INFO L78 Accepts]: Start accepts. Automaton has 157191 states and 581292 transitions. Word has length 52 [2019-12-28 00:28:12,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:28:12,134 INFO L462 AbstractCegarLoop]: Abstraction has 157191 states and 581292 transitions. [2019-12-28 00:28:12,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 00:28:12,134 INFO L276 IsEmpty]: Start isEmpty. Operand 157191 states and 581292 transitions. [2019-12-28 00:28:12,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-28 00:28:12,159 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:28:12,159 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:28:12,159 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:28:12,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:28:12,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1580132604, now seen corresponding path program 1 times [2019-12-28 00:28:12,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:28:12,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748718760] [2019-12-28 00:28:12,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:28:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:28:12,253 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 00:28:12,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748718760] [2019-12-28 00:28:12,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:28:12,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:28:12,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1427227591] [2019-12-28 00:28:12,255 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:28:12,262 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:28:12,279 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 117 states and 176 transitions. [2019-12-28 00:28:12,279 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:28:12,330 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 00:28:12,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 00:28:12,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:28:12,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 00:28:12,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:28:12,332 INFO L87 Difference]: Start difference. First operand 157191 states and 581292 transitions. Second operand 8 states. [2019-12-28 00:28:15,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:28:15,230 INFO L93 Difference]: Finished difference Result 212575 states and 766174 transitions. [2019-12-28 00:28:15,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 00:28:15,231 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-12-28 00:28:15,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:28:17,079 INFO L225 Difference]: With dead ends: 212575 [2019-12-28 00:28:17,079 INFO L226 Difference]: Without dead ends: 212055 [2019-12-28 00:28:17,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-28 00:28:24,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212055 states. [2019-12-28 00:28:27,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212055 to 157973. [2019-12-28 00:28:27,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157973 states. [2019-12-28 00:28:28,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157973 states to 157973 states and 584229 transitions. [2019-12-28 00:28:28,166 INFO L78 Accepts]: Start accepts. Automaton has 157973 states and 584229 transitions. Word has length 56 [2019-12-28 00:28:28,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:28:28,166 INFO L462 AbstractCegarLoop]: Abstraction has 157973 states and 584229 transitions. [2019-12-28 00:28:28,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 00:28:28,166 INFO L276 IsEmpty]: Start isEmpty. Operand 157973 states and 584229 transitions. [2019-12-28 00:28:28,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-28 00:28:28,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:28:28,190 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] [2019-12-28 00:28:28,191 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:28:28,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:28:28,191 INFO L82 PathProgramCache]: Analyzing trace with hash 193567859, now seen corresponding path program 1 times [2019-12-28 00:28:28,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:28:28,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289785745] [2019-12-28 00:28:28,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:28:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:28:28,245 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 00:28:28,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289785745] [2019-12-28 00:28:28,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:28:28,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 00:28:28,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [907246943] [2019-12-28 00:28:28,246 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:28:28,252 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:28:28,259 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 60 transitions. [2019-12-28 00:28:28,259 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:28:28,259 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:28:28,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 00:28:28,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:28:28,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 00:28:28,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 00:28:28,261 INFO L87 Difference]: Start difference. First operand 157973 states and 584229 transitions. Second operand 3 states. [2019-12-28 00:28:34,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:28:34,562 INFO L93 Difference]: Finished difference Result 175833 states and 650717 transitions. [2019-12-28 00:28:34,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 00:28:34,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-28 00:28:34,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:28:35,044 INFO L225 Difference]: With dead ends: 175833 [2019-12-28 00:28:35,044 INFO L226 Difference]: Without dead ends: 175833 [2019-12-28 00:28:35,045 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 00:28:36,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175833 states. [2019-12-28 00:28:39,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175833 to 166853. [2019-12-28 00:28:39,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166853 states. [2019-12-28 00:28:40,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166853 states to 166853 states and 617305 transitions. [2019-12-28 00:28:40,837 INFO L78 Accepts]: Start accepts. Automaton has 166853 states and 617305 transitions. Word has length 56 [2019-12-28 00:28:40,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:28:40,838 INFO L462 AbstractCegarLoop]: Abstraction has 166853 states and 617305 transitions. [2019-12-28 00:28:40,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 00:28:40,838 INFO L276 IsEmpty]: Start isEmpty. Operand 166853 states and 617305 transitions. [2019-12-28 00:28:40,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-28 00:28:40,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:28:40,859 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] [2019-12-28 00:28:40,859 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:28:40,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:28:40,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1320483597, now seen corresponding path program 1 times [2019-12-28 00:28:40,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:28:40,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078792463] [2019-12-28 00:28:40,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:28:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:28:40,973 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 00:28:40,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078792463] [2019-12-28 00:28:40,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:28:40,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:28:40,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1747153066] [2019-12-28 00:28:40,974 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:28:40,980 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:28:40,985 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 60 transitions. [2019-12-28 00:28:40,986 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:28:41,009 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 00:28:41,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 00:28:41,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:28:41,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 00:28:41,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:28:41,011 INFO L87 Difference]: Start difference. First operand 166853 states and 617305 transitions. Second operand 8 states. [2019-12-28 00:28:43,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:28:43,003 INFO L93 Difference]: Finished difference Result 213770 states and 787341 transitions. [2019-12-28 00:28:43,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 00:28:43,003 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-12-28 00:28:43,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:28:44,972 INFO L225 Difference]: With dead ends: 213770 [2019-12-28 00:28:44,972 INFO L226 Difference]: Without dead ends: 213770 [2019-12-28 00:28:44,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-28 00:28:53,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213770 states. [2019-12-28 00:28:56,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213770 to 193996. [2019-12-28 00:28:56,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193996 states. [2019-12-28 00:28:57,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193996 states to 193996 states and 714237 transitions. [2019-12-28 00:28:57,337 INFO L78 Accepts]: Start accepts. Automaton has 193996 states and 714237 transitions. Word has length 56 [2019-12-28 00:28:57,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:28:57,337 INFO L462 AbstractCegarLoop]: Abstraction has 193996 states and 714237 transitions. [2019-12-28 00:28:57,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 00:28:57,338 INFO L276 IsEmpty]: Start isEmpty. Operand 193996 states and 714237 transitions. [2019-12-28 00:28:57,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-28 00:28:57,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:28:57,363 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:28:57,363 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:28:57,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:28:57,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1177532340, now seen corresponding path program 1 times [2019-12-28 00:28:57,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:28:57,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697441867] [2019-12-28 00:28:57,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:28:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:28:57,493 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 00:28:57,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697441867] [2019-12-28 00:28:57,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:28:57,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 00:28:57,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1710642288] [2019-12-28 00:28:57,494 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:28:57,498 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:28:57,502 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 60 transitions. [2019-12-28 00:28:57,502 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:28:57,524 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 00:28:57,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 00:28:57,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:28:57,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 00:28:57,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-28 00:28:57,525 INFO L87 Difference]: Start difference. First operand 193996 states and 714237 transitions. Second operand 9 states. [2019-12-28 00:29:04,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:29:04,995 INFO L93 Difference]: Finished difference Result 277139 states and 986577 transitions. [2019-12-28 00:29:04,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 00:29:04,996 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-12-28 00:29:04,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:29:05,735 INFO L225 Difference]: With dead ends: 277139 [2019-12-28 00:29:05,736 INFO L226 Difference]: Without dead ends: 277139 [2019-12-28 00:29:05,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-12-28 00:29:08,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277139 states. [2019-12-28 00:29:12,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277139 to 222095. [2019-12-28 00:29:12,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222095 states. [2019-12-28 00:29:13,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222095 states to 222095 states and 805381 transitions. [2019-12-28 00:29:13,457 INFO L78 Accepts]: Start accepts. Automaton has 222095 states and 805381 transitions. Word has length 56 [2019-12-28 00:29:13,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:29:13,458 INFO L462 AbstractCegarLoop]: Abstraction has 222095 states and 805381 transitions. [2019-12-28 00:29:13,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 00:29:13,458 INFO L276 IsEmpty]: Start isEmpty. Operand 222095 states and 805381 transitions. [2019-12-28 00:29:13,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-28 00:29:13,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:29:13,484 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] [2019-12-28 00:29:13,485 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:29:13,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:29:13,485 INFO L82 PathProgramCache]: Analyzing trace with hash 2065036021, now seen corresponding path program 1 times [2019-12-28 00:29:13,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:29:13,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687097447] [2019-12-28 00:29:13,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:29:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:29:13,566 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 00:29:13,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687097447] [2019-12-28 00:29:13,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:29:13,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 00:29:13,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [576113500] [2019-12-28 00:29:13,567 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:29:13,573 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:29:13,579 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 60 transitions. [2019-12-28 00:29:13,580 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:29:13,580 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:29:13,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 00:29:13,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:29:13,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 00:29:13,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 00:29:13,582 INFO L87 Difference]: Start difference. First operand 222095 states and 805381 transitions. Second operand 3 states. [2019-12-28 00:29:15,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:29:15,662 INFO L93 Difference]: Finished difference Result 176991 states and 632039 transitions. [2019-12-28 00:29:15,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 00:29:15,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-28 00:29:15,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:29:16,138 INFO L225 Difference]: With dead ends: 176991 [2019-12-28 00:29:16,138 INFO L226 Difference]: Without dead ends: 176991 [2019-12-28 00:29:16,139 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 00:29:24,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176991 states. [2019-12-28 00:29:26,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176991 to 172179. [2019-12-28 00:29:26,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172179 states. [2019-12-28 00:29:27,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172179 states to 172179 states and 617064 transitions. [2019-12-28 00:29:27,987 INFO L78 Accepts]: Start accepts. Automaton has 172179 states and 617064 transitions. Word has length 56 [2019-12-28 00:29:27,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:29:27,987 INFO L462 AbstractCegarLoop]: Abstraction has 172179 states and 617064 transitions. [2019-12-28 00:29:27,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 00:29:27,987 INFO L276 IsEmpty]: Start isEmpty. Operand 172179 states and 617064 transitions. [2019-12-28 00:29:28,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-28 00:29:28,009 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:29:28,009 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] [2019-12-28 00:29:28,010 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:29:28,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:29:28,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1638616881, now seen corresponding path program 1 times [2019-12-28 00:29:28,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:29:28,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341662934] [2019-12-28 00:29:28,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:29:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:29:28,111 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 00:29:28,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341662934] [2019-12-28 00:29:28,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:29:28,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:29:28,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2143522456] [2019-12-28 00:29:28,112 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:29:28,118 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:29:28,123 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 57 transitions. [2019-12-28 00:29:28,123 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:29:28,124 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:29:28,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 00:29:28,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:29:28,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 00:29:28,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 00:29:28,125 INFO L87 Difference]: Start difference. First operand 172179 states and 617064 transitions. Second operand 6 states. [2019-12-28 00:29:30,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:29:30,684 INFO L93 Difference]: Finished difference Result 216118 states and 757197 transitions. [2019-12-28 00:29:30,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 00:29:30,684 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-28 00:29:30,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:29:31,242 INFO L225 Difference]: With dead ends: 216118 [2019-12-28 00:29:31,243 INFO L226 Difference]: Without dead ends: 216118 [2019-12-28 00:29:31,243 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 00:29:38,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216118 states. [2019-12-28 00:29:41,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216118 to 185519. [2019-12-28 00:29:41,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185519 states. [2019-12-28 00:29:42,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185519 states to 185519 states and 660439 transitions. [2019-12-28 00:29:42,345 INFO L78 Accepts]: Start accepts. Automaton has 185519 states and 660439 transitions. Word has length 57 [2019-12-28 00:29:42,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:29:42,345 INFO L462 AbstractCegarLoop]: Abstraction has 185519 states and 660439 transitions. [2019-12-28 00:29:42,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 00:29:42,345 INFO L276 IsEmpty]: Start isEmpty. Operand 185519 states and 660439 transitions. [2019-12-28 00:29:42,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-28 00:29:42,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:29:42,361 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] [2019-12-28 00:29:42,361 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:29:42,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:29:42,361 INFO L82 PathProgramCache]: Analyzing trace with hash -751113200, now seen corresponding path program 1 times [2019-12-28 00:29:42,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:29:42,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573261313] [2019-12-28 00:29:42,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:29:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:29:42,439 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 00:29:42,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573261313] [2019-12-28 00:29:42,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:29:42,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 00:29:42,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1315152110] [2019-12-28 00:29:42,440 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:29:42,445 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:29:42,450 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 57 transitions. [2019-12-28 00:29:42,450 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:29:42,451 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:29:42,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 00:29:42,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:29:42,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 00:29:42,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 00:29:42,452 INFO L87 Difference]: Start difference. First operand 185519 states and 660439 transitions. Second operand 4 states. [2019-12-28 00:29:42,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:29:42,559 INFO L93 Difference]: Finished difference Result 24459 states and 76335 transitions. [2019-12-28 00:29:42,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 00:29:42,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-28 00:29:42,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:29:42,588 INFO L225 Difference]: With dead ends: 24459 [2019-12-28 00:29:42,588 INFO L226 Difference]: Without dead ends: 18440 [2019-12-28 00:29:42,588 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 00:29:42,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18440 states. [2019-12-28 00:29:42,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18440 to 18193. [2019-12-28 00:29:42,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18193 states. [2019-12-28 00:29:42,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18193 states to 18193 states and 54576 transitions. [2019-12-28 00:29:42,831 INFO L78 Accepts]: Start accepts. Automaton has 18193 states and 54576 transitions. Word has length 57 [2019-12-28 00:29:42,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:29:42,832 INFO L462 AbstractCegarLoop]: Abstraction has 18193 states and 54576 transitions. [2019-12-28 00:29:42,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 00:29:42,832 INFO L276 IsEmpty]: Start isEmpty. Operand 18193 states and 54576 transitions. [2019-12-28 00:29:42,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 00:29:42,836 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:29:42,836 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:29:42,836 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:29:42,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:29:42,837 INFO L82 PathProgramCache]: Analyzing trace with hash -914504522, now seen corresponding path program 1 times [2019-12-28 00:29:42,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:29:42,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256043067] [2019-12-28 00:29:42,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:29:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:29:42,893 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 00:29:42,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256043067] [2019-12-28 00:29:42,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:29:42,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 00:29:42,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [757494443] [2019-12-28 00:29:42,894 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:29:42,903 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:29:42,928 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 135 states and 202 transitions. [2019-12-28 00:29:42,928 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:29:42,945 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 00:29:42,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 00:29:42,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:29:42,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 00:29:42,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:29:42,946 INFO L87 Difference]: Start difference. First operand 18193 states and 54576 transitions. Second operand 5 states. [2019-12-28 00:29:44,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:29:44,354 INFO L93 Difference]: Finished difference Result 23513 states and 70754 transitions. [2019-12-28 00:29:44,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 00:29:44,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-28 00:29:44,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:29:44,388 INFO L225 Difference]: With dead ends: 23513 [2019-12-28 00:29:44,388 INFO L226 Difference]: Without dead ends: 23513 [2019-12-28 00:29:44,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-28 00:29:44,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23513 states. [2019-12-28 00:29:44,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23513 to 21215. [2019-12-28 00:29:44,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21215 states. [2019-12-28 00:29:44,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21215 states to 21215 states and 63561 transitions. [2019-12-28 00:29:44,684 INFO L78 Accepts]: Start accepts. Automaton has 21215 states and 63561 transitions. Word has length 66 [2019-12-28 00:29:44,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:29:44,684 INFO L462 AbstractCegarLoop]: Abstraction has 21215 states and 63561 transitions. [2019-12-28 00:29:44,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 00:29:44,684 INFO L276 IsEmpty]: Start isEmpty. Operand 21215 states and 63561 transitions. [2019-12-28 00:29:44,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 00:29:44,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:29:44,690 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:29:44,690 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:29:44,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:29:44,690 INFO L82 PathProgramCache]: Analyzing trace with hash 828305813, now seen corresponding path program 1 times [2019-12-28 00:29:44,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:29:44,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120707490] [2019-12-28 00:29:44,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:29:44,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:29:44,753 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 00:29:44,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120707490] [2019-12-28 00:29:44,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:29:44,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:29:44,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [523197087] [2019-12-28 00:29:44,754 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:29:44,764 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:29:44,791 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 135 states and 202 transitions. [2019-12-28 00:29:44,791 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:29:44,810 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 00:29:44,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 00:29:44,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:29:44,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 00:29:44,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 00:29:44,811 INFO L87 Difference]: Start difference. First operand 21215 states and 63561 transitions. Second operand 7 states. [2019-12-28 00:29:45,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:29:45,494 INFO L93 Difference]: Finished difference Result 30327 states and 89101 transitions. [2019-12-28 00:29:45,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 00:29:45,494 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-28 00:29:45,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:29:45,538 INFO L225 Difference]: With dead ends: 30327 [2019-12-28 00:29:45,538 INFO L226 Difference]: Without dead ends: 30279 [2019-12-28 00:29:45,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-28 00:29:45,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30279 states. [2019-12-28 00:29:45,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30279 to 27632. [2019-12-28 00:29:45,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27632 states. [2019-12-28 00:29:45,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27632 states to 27632 states and 81448 transitions. [2019-12-28 00:29:45,918 INFO L78 Accepts]: Start accepts. Automaton has 27632 states and 81448 transitions. Word has length 66 [2019-12-28 00:29:45,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:29:45,919 INFO L462 AbstractCegarLoop]: Abstraction has 27632 states and 81448 transitions. [2019-12-28 00:29:45,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 00:29:45,919 INFO L276 IsEmpty]: Start isEmpty. Operand 27632 states and 81448 transitions. [2019-12-28 00:29:45,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-28 00:29:45,928 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:29:45,929 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:29:45,929 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:29:45,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:29:45,929 INFO L82 PathProgramCache]: Analyzing trace with hash 17339334, now seen corresponding path program 1 times [2019-12-28 00:29:45,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:29:45,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709409808] [2019-12-28 00:29:45,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:29:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:29:45,970 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 00:29:45,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709409808] [2019-12-28 00:29:45,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:29:45,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 00:29:45,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [110977501] [2019-12-28 00:29:45,971 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:29:45,984 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:29:46,972 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 165 states and 256 transitions. [2019-12-28 00:29:46,972 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:29:47,000 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 00:29:47,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 00:29:47,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:29:47,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 00:29:47,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:29:47,002 INFO L87 Difference]: Start difference. First operand 27632 states and 81448 transitions. Second operand 5 states. [2019-12-28 00:29:47,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:29:47,239 INFO L93 Difference]: Finished difference Result 30275 states and 87662 transitions. [2019-12-28 00:29:47,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 00:29:47,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-12-28 00:29:47,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:29:47,284 INFO L225 Difference]: With dead ends: 30275 [2019-12-28 00:29:47,285 INFO L226 Difference]: Without dead ends: 30275 [2019-12-28 00:29:47,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:29:47,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30275 states. [2019-12-28 00:29:47,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30275 to 26780. [2019-12-28 00:29:47,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26780 states. [2019-12-28 00:29:47,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26780 states to 26780 states and 76976 transitions. [2019-12-28 00:29:47,666 INFO L78 Accepts]: Start accepts. Automaton has 26780 states and 76976 transitions. Word has length 72 [2019-12-28 00:29:47,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:29:47,667 INFO L462 AbstractCegarLoop]: Abstraction has 26780 states and 76976 transitions. [2019-12-28 00:29:47,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 00:29:47,667 INFO L276 IsEmpty]: Start isEmpty. Operand 26780 states and 76976 transitions. [2019-12-28 00:29:47,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-28 00:29:47,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:29:47,678 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] [2019-12-28 00:29:47,678 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:29:47,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:29:47,679 INFO L82 PathProgramCache]: Analyzing trace with hash -709057717, now seen corresponding path program 1 times [2019-12-28 00:29:47,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:29:47,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147176935] [2019-12-28 00:29:47,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:29:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:29:47,744 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 00:29:47,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147176935] [2019-12-28 00:29:47,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:29:47,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 00:29:47,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1056033731] [2019-12-28 00:29:47,745 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:29:47,770 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:29:47,812 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 143 states and 210 transitions. [2019-12-28 00:29:47,813 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:29:47,814 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:29:47,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 00:29:47,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:29:47,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 00:29:47,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 00:29:47,816 INFO L87 Difference]: Start difference. First operand 26780 states and 76976 transitions. Second operand 4 states. [2019-12-28 00:29:48,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:29:48,585 INFO L93 Difference]: Finished difference Result 35102 states and 101172 transitions. [2019-12-28 00:29:48,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 00:29:48,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-28 00:29:48,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:29:48,639 INFO L225 Difference]: With dead ends: 35102 [2019-12-28 00:29:48,639 INFO L226 Difference]: Without dead ends: 34679 [2019-12-28 00:29:48,640 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 00:29:48,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34679 states. [2019-12-28 00:29:50,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34679 to 32876. [2019-12-28 00:29:50,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32876 states. [2019-12-28 00:29:50,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32876 states to 32876 states and 94660 transitions. [2019-12-28 00:29:50,675 INFO L78 Accepts]: Start accepts. Automaton has 32876 states and 94660 transitions. Word has length 74 [2019-12-28 00:29:50,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:29:50,676 INFO L462 AbstractCegarLoop]: Abstraction has 32876 states and 94660 transitions. [2019-12-28 00:29:50,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 00:29:50,676 INFO L276 IsEmpty]: Start isEmpty. Operand 32876 states and 94660 transitions. [2019-12-28 00:29:50,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-28 00:29:50,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:29:50,690 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:29:50,690 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:29:50,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:29:50,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1788958220, now seen corresponding path program 1 times [2019-12-28 00:29:50,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:29:50,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096721254] [2019-12-28 00:29:50,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:29:50,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:29:50,794 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 00:29:50,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096721254] [2019-12-28 00:29:50,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:29:50,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 00:29:50,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [191356776] [2019-12-28 00:29:50,797 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:29:50,809 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:29:50,840 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 143 states and 210 transitions. [2019-12-28 00:29:50,840 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:29:50,939 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 00:29:50,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 00:29:50,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:29:50,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 00:29:50,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-28 00:29:50,940 INFO L87 Difference]: Start difference. First operand 32876 states and 94660 transitions. Second operand 10 states. [2019-12-28 00:29:52,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:29:52,339 INFO L93 Difference]: Finished difference Result 37961 states and 107979 transitions. [2019-12-28 00:29:52,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 00:29:52,339 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 74 [2019-12-28 00:29:52,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:29:52,393 INFO L225 Difference]: With dead ends: 37961 [2019-12-28 00:29:52,393 INFO L226 Difference]: Without dead ends: 37961 [2019-12-28 00:29:52,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-12-28 00:29:52,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37961 states. [2019-12-28 00:29:52,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37961 to 35136. [2019-12-28 00:29:52,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35136 states. [2019-12-28 00:29:52,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35136 states to 35136 states and 100533 transitions. [2019-12-28 00:29:52,878 INFO L78 Accepts]: Start accepts. Automaton has 35136 states and 100533 transitions. Word has length 74 [2019-12-28 00:29:52,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:29:52,878 INFO L462 AbstractCegarLoop]: Abstraction has 35136 states and 100533 transitions. [2019-12-28 00:29:52,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 00:29:52,878 INFO L276 IsEmpty]: Start isEmpty. Operand 35136 states and 100533 transitions. [2019-12-28 00:29:52,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-28 00:29:52,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:29:52,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:29:52,891 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:29:52,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:29:52,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1618505395, now seen corresponding path program 1 times [2019-12-28 00:29:52,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:29:52,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400532768] [2019-12-28 00:29:52,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:29:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:29:52,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 00:29:52,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400532768] [2019-12-28 00:29:52,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:29:52,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:29:52,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [668289668] [2019-12-28 00:29:52,984 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:29:52,995 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:29:53,029 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 143 states and 210 transitions. [2019-12-28 00:29:53,029 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:29:53,367 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 00:29:53,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 00:29:53,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:29:53,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 00:29:53,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 00:29:53,368 INFO L87 Difference]: Start difference. First operand 35136 states and 100533 transitions. Second operand 6 states. [2019-12-28 00:29:53,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:29:53,457 INFO L93 Difference]: Finished difference Result 10800 states and 26832 transitions. [2019-12-28 00:29:53,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 00:29:53,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-12-28 00:29:53,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:29:53,472 INFO L225 Difference]: With dead ends: 10800 [2019-12-28 00:29:53,472 INFO L226 Difference]: Without dead ends: 9417 [2019-12-28 00:29:53,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:29:53,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9417 states. [2019-12-28 00:29:53,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9417 to 7148. [2019-12-28 00:29:53,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7148 states. [2019-12-28 00:29:53,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7148 states to 7148 states and 17806 transitions. [2019-12-28 00:29:53,606 INFO L78 Accepts]: Start accepts. Automaton has 7148 states and 17806 transitions. Word has length 74 [2019-12-28 00:29:53,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:29:53,606 INFO L462 AbstractCegarLoop]: Abstraction has 7148 states and 17806 transitions. [2019-12-28 00:29:53,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 00:29:53,607 INFO L276 IsEmpty]: Start isEmpty. Operand 7148 states and 17806 transitions. [2019-12-28 00:29:53,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-28 00:29:53,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:29:53,613 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:29:53,614 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:29:53,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:29:53,614 INFO L82 PathProgramCache]: Analyzing trace with hash -59117604, now seen corresponding path program 1 times [2019-12-28 00:29:53,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:29:53,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001329594] [2019-12-28 00:29:53,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:29:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:29:53,717 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 00:29:53,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001329594] [2019-12-28 00:29:53,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:29:53,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 00:29:53,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [918521326] [2019-12-28 00:29:53,719 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:29:53,748 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:29:53,824 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 140 states and 164 transitions. [2019-12-28 00:29:53,824 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:29:53,854 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 00:29:53,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 00:29:53,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:29:53,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 00:29:53,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:29:53,858 INFO L87 Difference]: Start difference. First operand 7148 states and 17806 transitions. Second operand 8 states. [2019-12-28 00:29:55,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:29:55,893 INFO L93 Difference]: Finished difference Result 14734 states and 35647 transitions. [2019-12-28 00:29:55,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-28 00:29:55,893 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 103 [2019-12-28 00:29:55,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:29:55,912 INFO L225 Difference]: With dead ends: 14734 [2019-12-28 00:29:55,912 INFO L226 Difference]: Without dead ends: 14712 [2019-12-28 00:29:55,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-12-28 00:29:55,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14712 states. [2019-12-28 00:29:56,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14712 to 11870. [2019-12-28 00:29:56,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11870 states. [2019-12-28 00:29:56,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11870 states to 11870 states and 29125 transitions. [2019-12-28 00:29:56,065 INFO L78 Accepts]: Start accepts. Automaton has 11870 states and 29125 transitions. Word has length 103 [2019-12-28 00:29:56,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:29:56,065 INFO L462 AbstractCegarLoop]: Abstraction has 11870 states and 29125 transitions. [2019-12-28 00:29:56,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 00:29:56,065 INFO L276 IsEmpty]: Start isEmpty. Operand 11870 states and 29125 transitions. [2019-12-28 00:29:56,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-28 00:29:56,077 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:29:56,077 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:29:56,077 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:29:56,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:29:56,078 INFO L82 PathProgramCache]: Analyzing trace with hash -70433731, now seen corresponding path program 1 times [2019-12-28 00:29:56,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:29:56,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881474989] [2019-12-28 00:29:56,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:29:56,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:29:56,152 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 00:29:56,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881474989] [2019-12-28 00:29:56,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:29:56,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 00:29:56,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [766099484] [2019-12-28 00:29:56,153 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:29:56,183 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:29:56,284 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 140 states and 164 transitions. [2019-12-28 00:29:56,284 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:29:56,284 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:29:56,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 00:29:56,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:29:56,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 00:29:56,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 00:29:56,286 INFO L87 Difference]: Start difference. First operand 11870 states and 29125 transitions. Second operand 4 states. [2019-12-28 00:29:56,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:29:56,738 INFO L93 Difference]: Finished difference Result 13187 states and 31833 transitions. [2019-12-28 00:29:56,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 00:29:56,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-12-28 00:29:56,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:29:56,764 INFO L225 Difference]: With dead ends: 13187 [2019-12-28 00:29:56,764 INFO L226 Difference]: Without dead ends: 13123 [2019-12-28 00:29:56,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 00:29:56,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13123 states. [2019-12-28 00:29:56,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13123 to 12573. [2019-12-28 00:29:56,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12573 states. [2019-12-28 00:29:56,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12573 states to 12573 states and 30516 transitions. [2019-12-28 00:29:56,989 INFO L78 Accepts]: Start accepts. Automaton has 12573 states and 30516 transitions. Word has length 103 [2019-12-28 00:29:56,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:29:56,989 INFO L462 AbstractCegarLoop]: Abstraction has 12573 states and 30516 transitions. [2019-12-28 00:29:56,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 00:29:56,989 INFO L276 IsEmpty]: Start isEmpty. Operand 12573 states and 30516 transitions. [2019-12-28 00:29:57,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-28 00:29:57,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:29:57,002 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:29:57,002 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:29:57,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:29:57,002 INFO L82 PathProgramCache]: Analyzing trace with hash -2069221445, now seen corresponding path program 1 times [2019-12-28 00:29:57,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:29:57,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510627827] [2019-12-28 00:29:57,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:29:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:29:57,119 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 00:29:57,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510627827] [2019-12-28 00:29:57,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:29:57,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 00:29:57,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1061907690] [2019-12-28 00:29:57,120 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:29:57,150 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:29:57,258 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 140 states and 164 transitions. [2019-12-28 00:29:57,258 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:29:57,259 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:29:57,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 00:29:57,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:29:57,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 00:29:57,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 00:29:57,260 INFO L87 Difference]: Start difference. First operand 12573 states and 30516 transitions. Second operand 7 states. [2019-12-28 00:29:57,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:29:57,922 INFO L93 Difference]: Finished difference Result 17481 states and 40719 transitions. [2019-12-28 00:29:57,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 00:29:57,923 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2019-12-28 00:29:57,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:29:57,942 INFO L225 Difference]: With dead ends: 17481 [2019-12-28 00:29:57,942 INFO L226 Difference]: Without dead ends: 17481 [2019-12-28 00:29:57,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-28 00:29:57,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17481 states. [2019-12-28 00:29:58,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17481 to 14867. [2019-12-28 00:29:58,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14867 states. [2019-12-28 00:29:58,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14867 states to 14867 states and 35132 transitions. [2019-12-28 00:29:58,134 INFO L78 Accepts]: Start accepts. Automaton has 14867 states and 35132 transitions. Word has length 103 [2019-12-28 00:29:58,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:29:58,134 INFO L462 AbstractCegarLoop]: Abstraction has 14867 states and 35132 transitions. [2019-12-28 00:29:58,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 00:29:58,134 INFO L276 IsEmpty]: Start isEmpty. Operand 14867 states and 35132 transitions. [2019-12-28 00:29:58,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-28 00:29:58,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:29:58,153 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:29:58,153 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:29:58,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:29:58,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1971009306, now seen corresponding path program 1 times [2019-12-28 00:29:58,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:29:58,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457294126] [2019-12-28 00:29:58,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:29:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:29:58,232 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 00:29:58,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457294126] [2019-12-28 00:29:58,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:29:58,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 00:29:58,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1725309140] [2019-12-28 00:29:58,234 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:29:58,263 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:29:58,353 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 140 states and 164 transitions. [2019-12-28 00:29:58,353 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:29:58,354 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:29:58,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 00:29:58,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:29:58,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 00:29:58,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 00:29:58,355 INFO L87 Difference]: Start difference. First operand 14867 states and 35132 transitions. Second operand 4 states. [2019-12-28 00:29:58,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:29:58,412 INFO L93 Difference]: Finished difference Result 14822 states and 35009 transitions. [2019-12-28 00:29:58,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 00:29:58,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-12-28 00:29:58,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:29:58,430 INFO L225 Difference]: With dead ends: 14822 [2019-12-28 00:29:58,430 INFO L226 Difference]: Without dead ends: 14822 [2019-12-28 00:29:58,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 00:29:58,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14822 states. [2019-12-28 00:29:58,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14822 to 14501. [2019-12-28 00:29:58,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14501 states. [2019-12-28 00:29:58,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14501 states to 14501 states and 34280 transitions. [2019-12-28 00:29:58,670 INFO L78 Accepts]: Start accepts. Automaton has 14501 states and 34280 transitions. Word has length 103 [2019-12-28 00:29:58,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:29:58,670 INFO L462 AbstractCegarLoop]: Abstraction has 14501 states and 34280 transitions. [2019-12-28 00:29:58,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 00:29:58,670 INFO L276 IsEmpty]: Start isEmpty. Operand 14501 states and 34280 transitions. [2019-12-28 00:29:58,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-28 00:29:58,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:29:58,684 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:29:58,685 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:29:58,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:29:58,685 INFO L82 PathProgramCache]: Analyzing trace with hash -336476230, now seen corresponding path program 1 times [2019-12-28 00:29:58,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:29:58,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994806825] [2019-12-28 00:29:58,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:29:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:29:58,782 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 00:29:58,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994806825] [2019-12-28 00:29:58,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:29:58,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 00:29:58,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1112063787] [2019-12-28 00:29:58,784 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:29:58,813 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:29:58,903 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 140 states and 164 transitions. [2019-12-28 00:29:58,903 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:29:58,904 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:29:58,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 00:29:58,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:29:58,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 00:29:58,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-28 00:29:58,905 INFO L87 Difference]: Start difference. First operand 14501 states and 34280 transitions. Second operand 4 states. [2019-12-28 00:29:59,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:29:59,222 INFO L93 Difference]: Finished difference Result 14577 states and 34470 transitions. [2019-12-28 00:29:59,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 00:29:59,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-12-28 00:29:59,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:29:59,238 INFO L225 Difference]: With dead ends: 14577 [2019-12-28 00:29:59,238 INFO L226 Difference]: Without dead ends: 14577 [2019-12-28 00:29:59,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-28 00:29:59,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14577 states. [2019-12-28 00:29:59,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14577 to 13987. [2019-12-28 00:29:59,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13987 states. [2019-12-28 00:29:59,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13987 states to 13987 states and 33135 transitions. [2019-12-28 00:29:59,391 INFO L78 Accepts]: Start accepts. Automaton has 13987 states and 33135 transitions. Word has length 103 [2019-12-28 00:29:59,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:29:59,391 INFO L462 AbstractCegarLoop]: Abstraction has 13987 states and 33135 transitions. [2019-12-28 00:29:59,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 00:29:59,391 INFO L276 IsEmpty]: Start isEmpty. Operand 13987 states and 33135 transitions. [2019-12-28 00:29:59,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-28 00:29:59,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:29:59,404 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:29:59,405 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:29:59,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:29:59,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1879253812, now seen corresponding path program 2 times [2019-12-28 00:29:59,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:29:59,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923920491] [2019-12-28 00:29:59,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:29:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:29:59,567 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 00:29:59,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923920491] [2019-12-28 00:29:59,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:29:59,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 00:29:59,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [874928503] [2019-12-28 00:29:59,577 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:29:59,634 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:29:59,750 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 137 states and 159 transitions. [2019-12-28 00:29:59,751 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:29:59,751 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:29:59,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 00:29:59,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:29:59,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 00:29:59,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-28 00:29:59,756 INFO L87 Difference]: Start difference. First operand 13987 states and 33135 transitions. Second operand 7 states. [2019-12-28 00:30:00,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:30:00,250 INFO L93 Difference]: Finished difference Result 14502 states and 34226 transitions. [2019-12-28 00:30:00,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 00:30:00,251 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2019-12-28 00:30:00,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:30:00,277 INFO L225 Difference]: With dead ends: 14502 [2019-12-28 00:30:00,277 INFO L226 Difference]: Without dead ends: 14502 [2019-12-28 00:30:00,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-28 00:30:00,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14502 states. [2019-12-28 00:30:00,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14502 to 14381. [2019-12-28 00:30:00,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14381 states. [2019-12-28 00:30:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14381 states to 14381 states and 33990 transitions. [2019-12-28 00:30:00,686 INFO L78 Accepts]: Start accepts. Automaton has 14381 states and 33990 transitions. Word has length 103 [2019-12-28 00:30:00,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:30:00,687 INFO L462 AbstractCegarLoop]: Abstraction has 14381 states and 33990 transitions. [2019-12-28 00:30:00,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 00:30:00,687 INFO L276 IsEmpty]: Start isEmpty. Operand 14381 states and 33990 transitions. [2019-12-28 00:30:00,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-28 00:30:00,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:30:00,706 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:30:00,706 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:30:00,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:30:00,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1528209803, now seen corresponding path program 1 times [2019-12-28 00:30:00,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:30:00,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350510578] [2019-12-28 00:30:00,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:30:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:30:00,751 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 00:30:00,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350510578] [2019-12-28 00:30:00,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:30:00,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 00:30:00,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [103692161] [2019-12-28 00:30:00,752 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:30:00,781 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:30:00,872 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 137 states and 159 transitions. [2019-12-28 00:30:00,873 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:30:00,878 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 00:30:00,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 00:30:00,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:30:00,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 00:30:00,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 00:30:00,879 INFO L87 Difference]: Start difference. First operand 14381 states and 33990 transitions. Second operand 3 states. [2019-12-28 00:30:00,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:30:00,932 INFO L93 Difference]: Finished difference Result 17223 states and 40607 transitions. [2019-12-28 00:30:00,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 00:30:00,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-12-28 00:30:00,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:30:00,952 INFO L225 Difference]: With dead ends: 17223 [2019-12-28 00:30:00,952 INFO L226 Difference]: Without dead ends: 17223 [2019-12-28 00:30:00,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 00:30:00,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17223 states. [2019-12-28 00:30:01,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17223 to 17159. [2019-12-28 00:30:01,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17159 states. [2019-12-28 00:30:01,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17159 states to 17159 states and 40469 transitions. [2019-12-28 00:30:01,149 INFO L78 Accepts]: Start accepts. Automaton has 17159 states and 40469 transitions. Word has length 103 [2019-12-28 00:30:01,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:30:01,150 INFO L462 AbstractCegarLoop]: Abstraction has 17159 states and 40469 transitions. [2019-12-28 00:30:01,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 00:30:01,150 INFO L276 IsEmpty]: Start isEmpty. Operand 17159 states and 40469 transitions. [2019-12-28 00:30:01,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-28 00:30:01,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:30:01,167 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:30:01,168 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:30:01,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:30:01,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1316858890, now seen corresponding path program 1 times [2019-12-28 00:30:01,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:30:01,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155676848] [2019-12-28 00:30:01,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:30:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:30:01,229 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 00:30:01,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155676848] [2019-12-28 00:30:01,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:30:01,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:30:01,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1181134307] [2019-12-28 00:30:01,231 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:30:01,260 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:30:01,353 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 137 states and 159 transitions. [2019-12-28 00:30:01,353 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:30:01,354 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:30:01,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 00:30:01,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:30:01,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 00:30:01,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:30:01,355 INFO L87 Difference]: Start difference. First operand 17159 states and 40469 transitions. Second operand 5 states. [2019-12-28 00:30:01,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:30:01,726 INFO L93 Difference]: Finished difference Result 18164 states and 42570 transitions. [2019-12-28 00:30:01,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 00:30:01,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-12-28 00:30:01,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:30:01,747 INFO L225 Difference]: With dead ends: 18164 [2019-12-28 00:30:01,747 INFO L226 Difference]: Without dead ends: 18164 [2019-12-28 00:30:01,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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 00:30:01,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18164 states. [2019-12-28 00:30:01,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18164 to 17126. [2019-12-28 00:30:01,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17126 states. [2019-12-28 00:30:01,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17126 states to 17126 states and 40335 transitions. [2019-12-28 00:30:01,973 INFO L78 Accepts]: Start accepts. Automaton has 17126 states and 40335 transitions. Word has length 103 [2019-12-28 00:30:01,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:30:01,974 INFO L462 AbstractCegarLoop]: Abstraction has 17126 states and 40335 transitions. [2019-12-28 00:30:01,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 00:30:01,974 INFO L276 IsEmpty]: Start isEmpty. Operand 17126 states and 40335 transitions. [2019-12-28 00:30:01,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-28 00:30:01,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:30:01,995 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:30:01,995 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:30:01,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:30:01,995 INFO L82 PathProgramCache]: Analyzing trace with hash -395452766, now seen corresponding path program 2 times [2019-12-28 00:30:01,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:30:01,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311162992] [2019-12-28 00:30:01,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:30:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:30:02,069 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 00:30:02,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311162992] [2019-12-28 00:30:02,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:30:02,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:30:02,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [337090819] [2019-12-28 00:30:02,070 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:30:02,099 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:30:02,305 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 150 states and 185 transitions. [2019-12-28 00:30:02,305 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:30:02,315 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 00:30:02,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 00:30:02,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:30:02,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 00:30:02,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 00:30:02,316 INFO L87 Difference]: Start difference. First operand 17126 states and 40335 transitions. Second operand 7 states. [2019-12-28 00:30:02,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:30:02,989 INFO L93 Difference]: Finished difference Result 20303 states and 47575 transitions. [2019-12-28 00:30:02,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 00:30:02,990 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2019-12-28 00:30:02,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:30:03,020 INFO L225 Difference]: With dead ends: 20303 [2019-12-28 00:30:03,021 INFO L226 Difference]: Without dead ends: 20303 [2019-12-28 00:30:03,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-28 00:30:03,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20303 states. [2019-12-28 00:30:03,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20303 to 17161. [2019-12-28 00:30:03,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17161 states. [2019-12-28 00:30:03,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17161 states to 17161 states and 40411 transitions. [2019-12-28 00:30:03,300 INFO L78 Accepts]: Start accepts. Automaton has 17161 states and 40411 transitions. Word has length 103 [2019-12-28 00:30:03,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:30:03,300 INFO L462 AbstractCegarLoop]: Abstraction has 17161 states and 40411 transitions. [2019-12-28 00:30:03,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 00:30:03,300 INFO L276 IsEmpty]: Start isEmpty. Operand 17161 states and 40411 transitions. [2019-12-28 00:30:03,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-28 00:30:03,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:30:03,318 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:30:03,318 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:30:03,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:30:03,318 INFO L82 PathProgramCache]: Analyzing trace with hash 2015950754, now seen corresponding path program 3 times [2019-12-28 00:30:03,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:30:03,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001702496] [2019-12-28 00:30:03,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:30:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:30:03,378 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 00:30:03,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001702496] [2019-12-28 00:30:03,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:30:03,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:30:03,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [713472110] [2019-12-28 00:30:03,379 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:30:03,399 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:30:03,540 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 163 states and 211 transitions. [2019-12-28 00:30:03,540 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:30:03,595 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-28 00:30:03,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 00:30:03,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:30:03,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 00:30:03,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:30:03,596 INFO L87 Difference]: Start difference. First operand 17161 states and 40411 transitions. Second operand 8 states. [2019-12-28 00:30:04,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:30:04,505 INFO L93 Difference]: Finished difference Result 21425 states and 49487 transitions. [2019-12-28 00:30:04,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 00:30:04,505 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 103 [2019-12-28 00:30:04,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:30:04,530 INFO L225 Difference]: With dead ends: 21425 [2019-12-28 00:30:04,530 INFO L226 Difference]: Without dead ends: 21425 [2019-12-28 00:30:04,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-28 00:30:04,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21425 states. [2019-12-28 00:30:04,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21425 to 17872. [2019-12-28 00:30:04,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17872 states. [2019-12-28 00:30:04,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17872 states to 17872 states and 41905 transitions. [2019-12-28 00:30:04,751 INFO L78 Accepts]: Start accepts. Automaton has 17872 states and 41905 transitions. Word has length 103 [2019-12-28 00:30:04,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:30:04,752 INFO L462 AbstractCegarLoop]: Abstraction has 17872 states and 41905 transitions. [2019-12-28 00:30:04,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 00:30:04,752 INFO L276 IsEmpty]: Start isEmpty. Operand 17872 states and 41905 transitions. [2019-12-28 00:30:04,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-28 00:30:04,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:30:04,767 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:30:04,768 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:30:04,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:30:04,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1862635831, now seen corresponding path program 1 times [2019-12-28 00:30:04,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:30:04,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650491022] [2019-12-28 00:30:04,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:30:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:30:04,921 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 00:30:04,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650491022] [2019-12-28 00:30:04,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:30:04,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 00:30:04,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [775338035] [2019-12-28 00:30:04,922 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:30:05,050 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:30:05,181 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 145 states and 172 transitions. [2019-12-28 00:30:05,181 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:30:05,250 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-28 00:30:05,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 00:30:05,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:30:05,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 00:30:05,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-28 00:30:05,251 INFO L87 Difference]: Start difference. First operand 17872 states and 41905 transitions. Second operand 11 states. [2019-12-28 00:30:05,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:30:05,946 INFO L93 Difference]: Finished difference Result 31679 states and 74471 transitions. [2019-12-28 00:30:05,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-28 00:30:05,946 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 105 [2019-12-28 00:30:05,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:30:05,990 INFO L225 Difference]: With dead ends: 31679 [2019-12-28 00:30:05,990 INFO L226 Difference]: Without dead ends: 28015 [2019-12-28 00:30:05,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2019-12-28 00:30:06,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28015 states. [2019-12-28 00:30:06,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28015 to 21000. [2019-12-28 00:30:06,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21000 states. [2019-12-28 00:30:06,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21000 states to 21000 states and 49025 transitions. [2019-12-28 00:30:06,323 INFO L78 Accepts]: Start accepts. Automaton has 21000 states and 49025 transitions. Word has length 105 [2019-12-28 00:30:06,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:30:06,324 INFO L462 AbstractCegarLoop]: Abstraction has 21000 states and 49025 transitions. [2019-12-28 00:30:06,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 00:30:06,324 INFO L276 IsEmpty]: Start isEmpty. Operand 21000 states and 49025 transitions. [2019-12-28 00:30:06,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-28 00:30:06,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:30:06,342 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:30:06,342 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:30:06,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:30:06,343 INFO L82 PathProgramCache]: Analyzing trace with hash 543960296, now seen corresponding path program 1 times [2019-12-28 00:30:06,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:30:06,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022602342] [2019-12-28 00:30:06,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:30:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:30:06,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 00:30:06,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022602342] [2019-12-28 00:30:06,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:30:06,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 00:30:06,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1107829297] [2019-12-28 00:30:06,447 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:30:06,467 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:30:06,589 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 199 transitions. [2019-12-28 00:30:06,590 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:30:06,611 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 00:30:06,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 00:30:06,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:30:06,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 00:30:06,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:30:06,612 INFO L87 Difference]: Start difference. First operand 21000 states and 49025 transitions. Second operand 8 states. [2019-12-28 00:30:08,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:30:08,352 INFO L93 Difference]: Finished difference Result 29315 states and 67382 transitions. [2019-12-28 00:30:08,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-28 00:30:08,353 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 105 [2019-12-28 00:30:08,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:30:08,385 INFO L225 Difference]: With dead ends: 29315 [2019-12-28 00:30:08,385 INFO L226 Difference]: Without dead ends: 29251 [2019-12-28 00:30:08,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-12-28 00:30:08,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29251 states. [2019-12-28 00:30:08,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29251 to 21577. [2019-12-28 00:30:08,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21577 states. [2019-12-28 00:30:08,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21577 states to 21577 states and 50222 transitions. [2019-12-28 00:30:08,799 INFO L78 Accepts]: Start accepts. Automaton has 21577 states and 50222 transitions. Word has length 105 [2019-12-28 00:30:08,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:30:08,799 INFO L462 AbstractCegarLoop]: Abstraction has 21577 states and 50222 transitions. [2019-12-28 00:30:08,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 00:30:08,799 INFO L276 IsEmpty]: Start isEmpty. Operand 21577 states and 50222 transitions. [2019-12-28 00:30:08,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-28 00:30:08,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:30:08,821 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:30:08,821 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:30:08,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:30:08,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1533249047, now seen corresponding path program 1 times [2019-12-28 00:30:08,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:30:08,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412050481] [2019-12-28 00:30:08,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:30:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:30:08,942 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 00:30:08,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412050481] [2019-12-28 00:30:08,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:30:08,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 00:30:08,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1077971976] [2019-12-28 00:30:08,943 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:30:08,962 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:30:09,102 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 199 transitions. [2019-12-28 00:30:09,103 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:30:09,135 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 00:30:09,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 00:30:09,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:30:09,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 00:30:09,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:30:09,137 INFO L87 Difference]: Start difference. First operand 21577 states and 50222 transitions. Second operand 8 states. [2019-12-28 00:30:09,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:30:09,395 INFO L93 Difference]: Finished difference Result 22263 states and 51699 transitions. [2019-12-28 00:30:09,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 00:30:09,396 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 105 [2019-12-28 00:30:09,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:30:09,421 INFO L225 Difference]: With dead ends: 22263 [2019-12-28 00:30:09,422 INFO L226 Difference]: Without dead ends: 16591 [2019-12-28 00:30:09,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-28 00:30:09,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16591 states. [2019-12-28 00:30:09,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16591 to 16589. [2019-12-28 00:30:09,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16589 states. [2019-12-28 00:30:09,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16589 states to 16589 states and 38935 transitions. [2019-12-28 00:30:09,710 INFO L78 Accepts]: Start accepts. Automaton has 16589 states and 38935 transitions. Word has length 105 [2019-12-28 00:30:09,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:30:09,711 INFO L462 AbstractCegarLoop]: Abstraction has 16589 states and 38935 transitions. [2019-12-28 00:30:09,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 00:30:09,711 INFO L276 IsEmpty]: Start isEmpty. Operand 16589 states and 38935 transitions. [2019-12-28 00:30:09,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-28 00:30:09,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:30:09,731 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:30:09,732 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:30:09,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:30:09,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1171325293, now seen corresponding path program 1 times [2019-12-28 00:30:09,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:30:09,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275416577] [2019-12-28 00:30:09,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:30:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:30:09,897 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 00:30:09,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275416577] [2019-12-28 00:30:09,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:30:09,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 00:30:09,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [682632879] [2019-12-28 00:30:09,898 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:30:09,918 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:30:10,019 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 162 states and 209 transitions. [2019-12-28 00:30:10,020 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:30:10,046 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 00:30:10,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 00:30:10,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:30:10,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 00:30:10,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-28 00:30:10,048 INFO L87 Difference]: Start difference. First operand 16589 states and 38935 transitions. Second operand 9 states. [2019-12-28 00:30:11,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:30:11,287 INFO L93 Difference]: Finished difference Result 19760 states and 45486 transitions. [2019-12-28 00:30:11,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-28 00:30:11,288 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-12-28 00:30:11,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:30:11,310 INFO L225 Difference]: With dead ends: 19760 [2019-12-28 00:30:11,310 INFO L226 Difference]: Without dead ends: 19702 [2019-12-28 00:30:11,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2019-12-28 00:30:11,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19702 states. [2019-12-28 00:30:11,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19702 to 17371. [2019-12-28 00:30:11,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17371 states. [2019-12-28 00:30:11,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17371 states to 17371 states and 40506 transitions. [2019-12-28 00:30:11,597 INFO L78 Accepts]: Start accepts. Automaton has 17371 states and 40506 transitions. Word has length 105 [2019-12-28 00:30:11,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:30:11,597 INFO L462 AbstractCegarLoop]: Abstraction has 17371 states and 40506 transitions. [2019-12-28 00:30:11,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 00:30:11,598 INFO L276 IsEmpty]: Start isEmpty. Operand 17371 states and 40506 transitions. [2019-12-28 00:30:11,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-28 00:30:11,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:30:11,613 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:30:11,613 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:30:11,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:30:11,613 INFO L82 PathProgramCache]: Analyzing trace with hash -283821612, now seen corresponding path program 1 times [2019-12-28 00:30:11,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:30:11,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311108308] [2019-12-28 00:30:11,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:30:11,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:30:11,683 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 00:30:11,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311108308] [2019-12-28 00:30:11,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:30:11,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 00:30:11,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2074929007] [2019-12-28 00:30:11,684 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:30:11,703 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:30:11,817 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 162 states and 209 transitions. [2019-12-28 00:30:11,817 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:30:11,818 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:30:11,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 00:30:11,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:30:11,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 00:30:11,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-28 00:30:11,820 INFO L87 Difference]: Start difference. First operand 17371 states and 40506 transitions. Second operand 7 states. [2019-12-28 00:30:12,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:30:12,524 INFO L93 Difference]: Finished difference Result 19092 states and 44145 transitions. [2019-12-28 00:30:12,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 00:30:12,525 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-12-28 00:30:12,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:30:12,546 INFO L225 Difference]: With dead ends: 19092 [2019-12-28 00:30:12,547 INFO L226 Difference]: Without dead ends: 19092 [2019-12-28 00:30:12,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:30:12,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19092 states. [2019-12-28 00:30:12,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19092 to 17175. [2019-12-28 00:30:12,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17175 states. [2019-12-28 00:30:12,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17175 states to 17175 states and 40110 transitions. [2019-12-28 00:30:12,739 INFO L78 Accepts]: Start accepts. Automaton has 17175 states and 40110 transitions. Word has length 105 [2019-12-28 00:30:12,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:30:12,740 INFO L462 AbstractCegarLoop]: Abstraction has 17175 states and 40110 transitions. [2019-12-28 00:30:12,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 00:30:12,740 INFO L276 IsEmpty]: Start isEmpty. Operand 17175 states and 40110 transitions. [2019-12-28 00:30:12,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-28 00:30:12,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:30:12,756 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:30:12,756 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:30:12,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:30:12,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1637589431, now seen corresponding path program 2 times [2019-12-28 00:30:12,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:30:12,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856286300] [2019-12-28 00:30:12,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:30:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:30:12,856 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 00:30:12,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856286300] [2019-12-28 00:30:12,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:30:12,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 00:30:12,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2118818962] [2019-12-28 00:30:12,857 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:30:12,876 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:30:12,977 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 183 states and 251 transitions. [2019-12-28 00:30:12,977 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:30:13,002 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 00:30:13,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 00:30:13,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:30:13,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 00:30:13,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:30:13,003 INFO L87 Difference]: Start difference. First operand 17175 states and 40110 transitions. Second operand 8 states. [2019-12-28 00:30:13,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:30:13,152 INFO L93 Difference]: Finished difference Result 17656 states and 41174 transitions. [2019-12-28 00:30:13,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 00:30:13,152 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 105 [2019-12-28 00:30:13,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:30:13,157 INFO L225 Difference]: With dead ends: 17656 [2019-12-28 00:30:13,157 INFO L226 Difference]: Without dead ends: 3174 [2019-12-28 00:30:13,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-28 00:30:13,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3174 states. [2019-12-28 00:30:13,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3174 to 3172. [2019-12-28 00:30:13,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3172 states. [2019-12-28 00:30:13,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3172 states to 3172 states and 7462 transitions. [2019-12-28 00:30:13,203 INFO L78 Accepts]: Start accepts. Automaton has 3172 states and 7462 transitions. Word has length 105 [2019-12-28 00:30:13,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:30:13,204 INFO L462 AbstractCegarLoop]: Abstraction has 3172 states and 7462 transitions. [2019-12-28 00:30:13,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 00:30:13,204 INFO L276 IsEmpty]: Start isEmpty. Operand 3172 states and 7462 transitions. [2019-12-28 00:30:13,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-28 00:30:13,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:30:13,209 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:30:13,209 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:30:13,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:30:13,209 INFO L82 PathProgramCache]: Analyzing trace with hash -582979528, now seen corresponding path program 1 times [2019-12-28 00:30:13,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:30:13,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451617107] [2019-12-28 00:30:13,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:30:13,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:30:13,361 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 00:30:13,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451617107] [2019-12-28 00:30:13,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:30:13,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-28 00:30:13,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [820432155] [2019-12-28 00:30:13,362 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:30:13,381 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:30:13,508 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 201 transitions. [2019-12-28 00:30:13,509 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:30:13,647 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 00:30:13,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-28 00:30:13,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:30:13,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-28 00:30:13,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-12-28 00:30:13,649 INFO L87 Difference]: Start difference. First operand 3172 states and 7462 transitions. Second operand 15 states. [2019-12-28 00:30:17,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:30:17,194 INFO L93 Difference]: Finished difference Result 6641 states and 15221 transitions. [2019-12-28 00:30:17,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-28 00:30:17,194 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 105 [2019-12-28 00:30:17,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:30:17,201 INFO L225 Difference]: With dead ends: 6641 [2019-12-28 00:30:17,201 INFO L226 Difference]: Without dead ends: 5043 [2019-12-28 00:30:17,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=291, Invalid=1601, Unknown=0, NotChecked=0, Total=1892 [2019-12-28 00:30:17,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5043 states. [2019-12-28 00:30:17,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5043 to 3227. [2019-12-28 00:30:17,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3227 states. [2019-12-28 00:30:17,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3227 states to 3227 states and 7523 transitions. [2019-12-28 00:30:17,241 INFO L78 Accepts]: Start accepts. Automaton has 3227 states and 7523 transitions. Word has length 105 [2019-12-28 00:30:17,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:30:17,242 INFO L462 AbstractCegarLoop]: Abstraction has 3227 states and 7523 transitions. [2019-12-28 00:30:17,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-28 00:30:17,242 INFO L276 IsEmpty]: Start isEmpty. Operand 3227 states and 7523 transitions. [2019-12-28 00:30:17,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-28 00:30:17,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:30:17,245 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:30:17,245 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:30:17,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:30:17,245 INFO L82 PathProgramCache]: Analyzing trace with hash -633160074, now seen corresponding path program 2 times [2019-12-28 00:30:17,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:30:17,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405467195] [2019-12-28 00:30:17,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:30:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 00:30:17,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 00:30:17,329 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 00:30:17,330 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 00:30:17,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 12:30:17 BasicIcfg [2019-12-28 00:30:17,520 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 00:30:17,522 INFO L168 Benchmark]: Toolchain (without parser) took 173659.89 ms. Allocated memory was 139.5 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 101.9 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-28 00:30:17,525 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-28 00:30:17,525 INFO L168 Benchmark]: CACSL2BoogieTranslator took 811.98 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 101.5 MB in the beginning and 156.6 MB in the end (delta: -55.1 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-28 00:30:17,526 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.66 ms. Allocated memory is still 203.4 MB. Free memory was 156.6 MB in the beginning and 153.4 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-28 00:30:17,526 INFO L168 Benchmark]: Boogie Preprocessor took 39.20 ms. Allocated memory is still 203.4 MB. Free memory was 153.4 MB in the beginning and 151.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-28 00:30:17,526 INFO L168 Benchmark]: RCFGBuilder took 1062.19 ms. Allocated memory is still 203.4 MB. Free memory was 150.8 MB in the beginning and 97.9 MB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2019-12-28 00:30:17,527 INFO L168 Benchmark]: TraceAbstraction took 171679.33 ms. Allocated memory was 203.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 97.9 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-28 00:30:17,530 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 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 811.98 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 101.5 MB in the beginning and 156.6 MB in the end (delta: -55.1 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.66 ms. Allocated memory is still 203.4 MB. Free memory was 156.6 MB in the beginning and 153.4 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.20 ms. Allocated memory is still 203.4 MB. Free memory was 153.4 MB in the beginning and 151.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1062.19 ms. Allocated memory is still 203.4 MB. Free memory was 150.8 MB in the beginning and 97.9 MB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 171679.33 ms. Allocated memory was 203.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 97.9 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L701] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L703] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L704] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L705] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L707] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L709] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L710] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L711] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L712] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L713] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L714] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L715] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L716] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L717] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L718] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L719] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}] [L720] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L721] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L722] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L723] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L725] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0] [L726] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0] [L727] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0] [L817] 0 pthread_t t255; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0] [L818] FCALL, FORK 0 pthread_create(&t255, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0] [L819] 0 pthread_t t256; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0] [L820] FCALL, FORK 0 pthread_create(&t256, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0] [L765] 2 y$w_buff1 = y$w_buff0 [L766] 2 y$w_buff0 = 1 [L767] 2 y$w_buff1_used = y$w_buff0_used [L768] 2 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0] [L770] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L771] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L772] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L773] 2 y$r_buff0_thd2 = (_Bool)1 [L776] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 2 y$flush_delayed = weak$$choice2 [L779] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] 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) [L781] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 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)) [L782] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L782] 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)) [L783] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 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)) [L784] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 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)) [L785] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L785] 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)) [L786] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 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)) [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 2 y = y$flush_delayed ? y$mem_tmp : y [L789] 2 y$flush_delayed = (_Bool)0 [L792] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L731] 1 z = 1 [L734] 1 x = 1 [L737] 1 __unbuffered_p0_EAX = x [L740] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L741] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L742] 1 y$flush_delayed = weak$$choice2 [L743] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] 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) [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L796] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L797] 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 [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 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 [L798] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L799] 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 [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 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 [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L745] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L745] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L746] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L747] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L750] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 1 y = y$flush_delayed ? y$mem_tmp : y [L753] 1 y$flush_delayed = (_Bool)0 [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] 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) [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L828] 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 [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L830] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 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 [L833] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 174 locations, 2 error locations. Result: UNSAFE, OverallTime: 171.2s, OverallIterations: 35, TraceHistogramMax: 1, AutomataDifference: 63.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 12616 SDtfs, 18072 SDslu, 33967 SDs, 0 SdLazy, 14623 SolverSat, 883 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 458 GetRequests, 148 SyntacticMatches, 21 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222095occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 90.3s AutomataMinimizationTime, 34 MinimizatonAttempts, 253974 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2882 NumberOfCodeBlocks, 2882 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2743 ConstructedInterpolants, 0 QuantifiedInterpolants, 619464 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...