/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/rfi001_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 03:40:42,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 03:40:42,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 03:40:42,866 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 03:40:42,866 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 03:40:42,867 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 03:40:42,871 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 03:40:42,873 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 03:40:42,877 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 03:40:42,880 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 03:40:42,882 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 03:40:42,890 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 03:40:42,890 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 03:40:42,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 03:40:42,892 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 03:40:42,895 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 03:40:42,896 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 03:40:42,898 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 03:40:42,899 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 03:40:42,902 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 03:40:42,905 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 03:40:42,907 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 03:40:42,909 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 03:40:42,910 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 03:40:42,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 03:40:42,914 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 03:40:42,914 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 03:40:42,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 03:40:42,917 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 03:40:42,919 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 03:40:42,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 03:40:42,921 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 03:40:42,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 03:40:42,924 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 03:40:42,925 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 03:40:42,925 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 03:40:42,926 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 03:40:42,926 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 03:40:42,926 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 03:40:42,928 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 03:40:42,930 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 03:40:42,931 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-MCR.epf [2019-12-28 03:40:42,964 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 03:40:42,965 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 03:40:42,968 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 03:40:42,968 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 03:40:42,969 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 03:40:42,969 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 03:40:42,969 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 03:40:42,969 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 03:40:42,969 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 03:40:42,970 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 03:40:42,970 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 03:40:42,970 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 03:40:42,970 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 03:40:42,970 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 03:40:42,970 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 03:40:42,973 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 03:40:42,973 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 03:40:42,974 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 03:40:42,974 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 03:40:42,974 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 03:40:42,974 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 03:40:42,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 03:40:42,975 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 03:40:42,975 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 03:40:42,975 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 03:40:42,975 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 03:40:42,976 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 03:40:42,976 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 03:40:42,976 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 03:40:42,976 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 03:40:42,977 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 03:40:42,977 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 03:40:43,246 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 03:40:43,264 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 03:40:43,267 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 03:40:43,268 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 03:40:43,268 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 03:40:43,269 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_rmo.opt.i [2019-12-28 03:40:43,336 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/014659978/b09641756c9d4579af6458803ff80d52/FLAG9840ecd19 [2019-12-28 03:40:43,883 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 03:40:43,884 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_rmo.opt.i [2019-12-28 03:40:43,899 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/014659978/b09641756c9d4579af6458803ff80d52/FLAG9840ecd19 [2019-12-28 03:40:44,215 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/014659978/b09641756c9d4579af6458803ff80d52 [2019-12-28 03:40:44,223 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 03:40:44,225 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 03:40:44,226 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 03:40:44,226 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 03:40:44,231 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 03:40:44,232 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:40:44" (1/1) ... [2019-12-28 03:40:44,235 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47b7aa10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:40:44, skipping insertion in model container [2019-12-28 03:40:44,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:40:44" (1/1) ... [2019-12-28 03:40:44,244 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 03:40:44,311 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 03:40:44,833 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 03:40:44,849 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 03:40:44,915 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 03:40:44,992 INFO L208 MainTranslator]: Completed translation [2019-12-28 03:40:44,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:40:44 WrapperNode [2019-12-28 03:40:44,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 03:40:44,993 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 03:40:44,994 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 03:40:44,994 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 03:40:45,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:40:44" (1/1) ... [2019-12-28 03:40:45,030 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:40:44" (1/1) ... [2019-12-28 03:40:45,072 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 03:40:45,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 03:40:45,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 03:40:45,072 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 03:40:45,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:40:44" (1/1) ... [2019-12-28 03:40:45,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:40:44" (1/1) ... [2019-12-28 03:40:45,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:40:44" (1/1) ... [2019-12-28 03:40:45,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:40:44" (1/1) ... [2019-12-28 03:40:45,098 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:40:44" (1/1) ... [2019-12-28 03:40:45,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:40:44" (1/1) ... [2019-12-28 03:40:45,106 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:40:44" (1/1) ... [2019-12-28 03:40:45,111 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 03:40:45,112 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 03:40:45,112 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 03:40:45,112 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 03:40:45,113 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:40:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 03:40:45,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 03:40:45,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 03:40:45,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 03:40:45,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 03:40:45,186 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 03:40:45,186 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 03:40:45,186 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 03:40:45,186 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 03:40:45,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 03:40:45,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 03:40:45,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 03:40:45,189 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-28 03:40:45,899 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 03:40:45,899 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 03:40:45,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:40:45 BoogieIcfgContainer [2019-12-28 03:40:45,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 03:40:45,902 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 03:40:45,902 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 03:40:45,906 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 03:40:45,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 03:40:44" (1/3) ... [2019-12-28 03:40:45,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e7ec727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:40:45, skipping insertion in model container [2019-12-28 03:40:45,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:40:44" (2/3) ... [2019-12-28 03:40:45,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e7ec727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:40:45, skipping insertion in model container [2019-12-28 03:40:45,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:40:45" (3/3) ... [2019-12-28 03:40:45,910 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_rmo.opt.i [2019-12-28 03:40:45,921 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 03:40:45,921 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 03:40:45,930 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 03:40:45,931 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 03:40:45,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,969 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,969 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,979 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,980 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,980 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,981 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,981 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:45,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:46,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:46,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:46,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:46,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:46,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:46,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:46,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:46,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:46,002 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:46,002 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:46,007 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:46,007 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:46,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:46,008 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:46,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:46,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:46,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:46,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:46,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:46,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:46,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:46,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:46,027 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 03:40:46,049 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 03:40:46,049 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 03:40:46,049 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 03:40:46,049 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 03:40:46,049 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 03:40:46,050 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 03:40:46,050 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 03:40:46,050 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 03:40:46,066 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 148 places, 182 transitions [2019-12-28 03:40:47,364 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22496 states. [2019-12-28 03:40:47,366 INFO L276 IsEmpty]: Start isEmpty. Operand 22496 states. [2019-12-28 03:40:47,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-28 03:40:47,376 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:40:47,377 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] [2019-12-28 03:40:47,378 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:40:47,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:40:47,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1922426572, now seen corresponding path program 1 times [2019-12-28 03:40:47,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:40:47,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465396743] [2019-12-28 03:40:47,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:40:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:40:47,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:40:47,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465396743] [2019-12-28 03:40:47,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:40:47,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:40:47,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [747035641] [2019-12-28 03:40:47,746 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:40:47,755 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:40:47,783 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 39 transitions. [2019-12-28 03:40:47,784 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:40:47,788 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:40:47,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:40:47,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:40:47,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:40:47,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:40:47,801 INFO L87 Difference]: Start difference. First operand 22496 states. Second operand 4 states. [2019-12-28 03:40:48,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:40:48,484 INFO L93 Difference]: Finished difference Result 23448 states and 91749 transitions. [2019-12-28 03:40:48,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:40:48,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-28 03:40:48,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:40:48,712 INFO L225 Difference]: With dead ends: 23448 [2019-12-28 03:40:48,713 INFO L226 Difference]: Without dead ends: 21272 [2019-12-28 03:40:48,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:40:49,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21272 states. [2019-12-28 03:40:50,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21272 to 21272. [2019-12-28 03:40:50,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21272 states. [2019-12-28 03:40:50,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21272 states to 21272 states and 83773 transitions. [2019-12-28 03:40:50,627 INFO L78 Accepts]: Start accepts. Automaton has 21272 states and 83773 transitions. Word has length 39 [2019-12-28 03:40:50,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:40:50,628 INFO L462 AbstractCegarLoop]: Abstraction has 21272 states and 83773 transitions. [2019-12-28 03:40:50,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:40:50,628 INFO L276 IsEmpty]: Start isEmpty. Operand 21272 states and 83773 transitions. [2019-12-28 03:40:50,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-28 03:40:50,638 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:40:50,639 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:40:50,639 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:40:50,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:40:50,639 INFO L82 PathProgramCache]: Analyzing trace with hash -184333443, now seen corresponding path program 1 times [2019-12-28 03:40:50,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:40:50,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315693681] [2019-12-28 03:40:50,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:40:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:40:50,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:40:50,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315693681] [2019-12-28 03:40:50,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:40:50,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:40:50,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1509721901] [2019-12-28 03:40:50,772 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:40:50,779 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:40:50,787 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 75 states and 102 transitions. [2019-12-28 03:40:50,787 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:40:50,871 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:40:50,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:40:50,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:40:50,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:40:50,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:40:50,873 INFO L87 Difference]: Start difference. First operand 21272 states and 83773 transitions. Second operand 6 states. [2019-12-28 03:40:52,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:40:52,067 INFO L93 Difference]: Finished difference Result 34706 states and 129065 transitions. [2019-12-28 03:40:52,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:40:52,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-12-28 03:40:52,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:40:52,239 INFO L225 Difference]: With dead ends: 34706 [2019-12-28 03:40:52,239 INFO L226 Difference]: Without dead ends: 34562 [2019-12-28 03:40:52,240 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 03:40:52,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34562 states. [2019-12-28 03:40:54,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34562 to 33062. [2019-12-28 03:40:54,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33062 states. [2019-12-28 03:40:54,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33062 states to 33062 states and 123953 transitions. [2019-12-28 03:40:54,754 INFO L78 Accepts]: Start accepts. Automaton has 33062 states and 123953 transitions. Word has length 46 [2019-12-28 03:40:54,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:40:54,756 INFO L462 AbstractCegarLoop]: Abstraction has 33062 states and 123953 transitions. [2019-12-28 03:40:54,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:40:54,756 INFO L276 IsEmpty]: Start isEmpty. Operand 33062 states and 123953 transitions. [2019-12-28 03:40:54,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-28 03:40:54,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:40:54,760 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:40:54,761 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:40:54,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:40:54,761 INFO L82 PathProgramCache]: Analyzing trace with hash -2043575512, now seen corresponding path program 1 times [2019-12-28 03:40:54,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:40:54,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215804890] [2019-12-28 03:40:54,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:40:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:40:54,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:40:54,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215804890] [2019-12-28 03:40:54,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:40:54,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:40:54,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1862922235] [2019-12-28 03:40:54,904 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:40:54,908 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:40:54,912 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 47 transitions. [2019-12-28 03:40:54,913 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:40:54,914 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:40:54,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:40:54,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:40:54,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:40:54,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:40:54,916 INFO L87 Difference]: Start difference. First operand 33062 states and 123953 transitions. Second operand 5 states. [2019-12-28 03:40:55,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:40:55,519 INFO L93 Difference]: Finished difference Result 40214 states and 148622 transitions. [2019-12-28 03:40:55,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:40:55,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-28 03:40:55,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:40:55,781 INFO L225 Difference]: With dead ends: 40214 [2019-12-28 03:40:55,782 INFO L226 Difference]: Without dead ends: 40054 [2019-12-28 03:40:55,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:40:57,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40054 states. [2019-12-28 03:40:58,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40054 to 34635. [2019-12-28 03:40:58,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34635 states. [2019-12-28 03:40:58,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34635 states to 34635 states and 129249 transitions. [2019-12-28 03:40:58,234 INFO L78 Accepts]: Start accepts. Automaton has 34635 states and 129249 transitions. Word has length 47 [2019-12-28 03:40:58,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:40:58,235 INFO L462 AbstractCegarLoop]: Abstraction has 34635 states and 129249 transitions. [2019-12-28 03:40:58,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:40:58,235 INFO L276 IsEmpty]: Start isEmpty. Operand 34635 states and 129249 transitions. [2019-12-28 03:40:58,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 03:40:58,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:40:58,248 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:40:58,248 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:40:58,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:40:58,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1974753575, now seen corresponding path program 1 times [2019-12-28 03:40:58,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:40:58,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878570594] [2019-12-28 03:40:58,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:40:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:40:58,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:40:58,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878570594] [2019-12-28 03:40:58,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:40:58,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:40:58,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [25926093] [2019-12-28 03:40:58,582 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:40:58,589 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:40:58,600 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 97 states and 138 transitions. [2019-12-28 03:40:58,601 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:40:58,623 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:40:58,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:40:58,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:40:58,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:40:58,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:40:58,625 INFO L87 Difference]: Start difference. First operand 34635 states and 129249 transitions. Second operand 7 states. [2019-12-28 03:40:59,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:40:59,647 INFO L93 Difference]: Finished difference Result 45663 states and 166143 transitions. [2019-12-28 03:40:59,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 03:40:59,647 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-28 03:40:59,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:40:59,768 INFO L225 Difference]: With dead ends: 45663 [2019-12-28 03:40:59,768 INFO L226 Difference]: Without dead ends: 45519 [2019-12-28 03:40:59,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-12-28 03:41:00,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45519 states. [2019-12-28 03:41:01,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45519 to 33598. [2019-12-28 03:41:01,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33598 states. [2019-12-28 03:41:02,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33598 states to 33598 states and 125404 transitions. [2019-12-28 03:41:02,066 INFO L78 Accepts]: Start accepts. Automaton has 33598 states and 125404 transitions. Word has length 54 [2019-12-28 03:41:02,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:02,066 INFO L462 AbstractCegarLoop]: Abstraction has 33598 states and 125404 transitions. [2019-12-28 03:41:02,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:41:02,066 INFO L276 IsEmpty]: Start isEmpty. Operand 33598 states and 125404 transitions. [2019-12-28 03:41:02,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-28 03:41:02,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:02,100 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:41:02,100 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:02,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:02,100 INFO L82 PathProgramCache]: Analyzing trace with hash 194121141, now seen corresponding path program 1 times [2019-12-28 03:41:02,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:02,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700091629] [2019-12-28 03:41:02,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:02,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:41:02,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700091629] [2019-12-28 03:41:02,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:02,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:41:02,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [346160064] [2019-12-28 03:41:02,198 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:02,206 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:02,216 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 61 transitions. [2019-12-28 03:41:02,216 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:02,217 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:41:02,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:41:02,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:02,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:41:02,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:41:02,218 INFO L87 Difference]: Start difference. First operand 33598 states and 125404 transitions. Second operand 6 states. [2019-12-28 03:41:03,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:03,172 INFO L93 Difference]: Finished difference Result 46070 states and 167837 transitions. [2019-12-28 03:41:03,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 03:41:03,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-28 03:41:03,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:03,307 INFO L225 Difference]: With dead ends: 46070 [2019-12-28 03:41:03,307 INFO L226 Difference]: Without dead ends: 45830 [2019-12-28 03:41:03,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-28 03:41:03,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45830 states. [2019-12-28 03:41:04,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45830 to 39959. [2019-12-28 03:41:04,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39959 states. [2019-12-28 03:41:04,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39959 states to 39959 states and 147328 transitions. [2019-12-28 03:41:04,570 INFO L78 Accepts]: Start accepts. Automaton has 39959 states and 147328 transitions. Word has length 61 [2019-12-28 03:41:04,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:04,570 INFO L462 AbstractCegarLoop]: Abstraction has 39959 states and 147328 transitions. [2019-12-28 03:41:04,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:41:04,570 INFO L276 IsEmpty]: Start isEmpty. Operand 39959 states and 147328 transitions. [2019-12-28 03:41:04,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-28 03:41:04,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:04,601 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] [2019-12-28 03:41:04,602 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:04,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:04,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1160701436, now seen corresponding path program 1 times [2019-12-28 03:41:04,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:04,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133350881] [2019-12-28 03:41:04,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:04,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:41:04,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133350881] [2019-12-28 03:41:04,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:04,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:41:04,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [89403176] [2019-12-28 03:41:04,662 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:04,672 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:04,684 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 63 transitions. [2019-12-28 03:41:04,685 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:04,686 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:41:04,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:41:04,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:04,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:41:04,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:41:04,687 INFO L87 Difference]: Start difference. First operand 39959 states and 147328 transitions. Second operand 3 states. [2019-12-28 03:41:04,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:04,947 INFO L93 Difference]: Finished difference Result 50257 states and 182163 transitions. [2019-12-28 03:41:04,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:41:04,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-28 03:41:04,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:05,097 INFO L225 Difference]: With dead ends: 50257 [2019-12-28 03:41:05,097 INFO L226 Difference]: Without dead ends: 50257 [2019-12-28 03:41:05,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:41:05,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50257 states. [2019-12-28 03:41:07,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50257 to 43889. [2019-12-28 03:41:07,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43889 states. [2019-12-28 03:41:07,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43889 states to 43889 states and 160766 transitions. [2019-12-28 03:41:07,824 INFO L78 Accepts]: Start accepts. Automaton has 43889 states and 160766 transitions. Word has length 63 [2019-12-28 03:41:07,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:07,825 INFO L462 AbstractCegarLoop]: Abstraction has 43889 states and 160766 transitions. [2019-12-28 03:41:07,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:41:07,825 INFO L276 IsEmpty]: Start isEmpty. Operand 43889 states and 160766 transitions. [2019-12-28 03:41:07,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 03:41:07,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:07,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:41:07,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 03:41:07,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:07,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1771534722, now seen corresponding path program 1 times [2019-12-28 03:41:07,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:07,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087321412] [2019-12-28 03:41:07,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:07,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:41:07,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087321412] [2019-12-28 03:41:07,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:07,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:41:07,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1557760683] [2019-12-28 03:41:07,964 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:07,974 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:07,989 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 67 transitions. [2019-12-28 03:41:07,989 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:07,990 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:41:07,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:41:07,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:07,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:41:07,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:41:07,991 INFO L87 Difference]: Start difference. First operand 43889 states and 160766 transitions. Second operand 7 states. [2019-12-28 03:41:08,725 WARN L192 SmtUtils]: Spent 315.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-12-28 03:41:09,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:09,301 INFO L93 Difference]: Finished difference Result 55885 states and 200500 transitions. [2019-12-28 03:41:09,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-28 03:41:09,302 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-28 03:41:09,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:09,424 INFO L225 Difference]: With dead ends: 55885 [2019-12-28 03:41:09,424 INFO L226 Difference]: Without dead ends: 55645 [2019-12-28 03:41:09,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-12-28 03:41:09,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55645 states. [2019-12-28 03:41:12,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55645 to 45115. [2019-12-28 03:41:12,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45115 states. [2019-12-28 03:41:12,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45115 states to 45115 states and 164933 transitions. [2019-12-28 03:41:12,348 INFO L78 Accepts]: Start accepts. Automaton has 45115 states and 164933 transitions. Word has length 67 [2019-12-28 03:41:12,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:12,348 INFO L462 AbstractCegarLoop]: Abstraction has 45115 states and 164933 transitions. [2019-12-28 03:41:12,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:41:12,348 INFO L276 IsEmpty]: Start isEmpty. Operand 45115 states and 164933 transitions. [2019-12-28 03:41:12,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 03:41:12,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:12,382 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] [2019-12-28 03:41:12,382 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:12,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:12,383 INFO L82 PathProgramCache]: Analyzing trace with hash -93886554, now seen corresponding path program 1 times [2019-12-28 03:41:12,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:12,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325778287] [2019-12-28 03:41:12,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:12,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:41:12,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325778287] [2019-12-28 03:41:12,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:12,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:41:12,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [560861110] [2019-12-28 03:41:12,474 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:12,486 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:12,511 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 152 transitions. [2019-12-28 03:41:12,511 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:12,535 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:41:12,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:41:12,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:12,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:41:12,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:41:12,537 INFO L87 Difference]: Start difference. First operand 45115 states and 164933 transitions. Second operand 8 states. [2019-12-28 03:41:13,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:13,710 INFO L93 Difference]: Finished difference Result 55099 states and 197677 transitions. [2019-12-28 03:41:13,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-28 03:41:13,710 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-12-28 03:41:13,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:13,821 INFO L225 Difference]: With dead ends: 55099 [2019-12-28 03:41:13,821 INFO L226 Difference]: Without dead ends: 54899 [2019-12-28 03:41:13,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2019-12-28 03:41:14,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54899 states. [2019-12-28 03:41:14,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54899 to 45993. [2019-12-28 03:41:14,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45993 states. [2019-12-28 03:41:15,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45993 states to 45993 states and 167804 transitions. [2019-12-28 03:41:15,024 INFO L78 Accepts]: Start accepts. Automaton has 45993 states and 167804 transitions. Word has length 68 [2019-12-28 03:41:15,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:15,024 INFO L462 AbstractCegarLoop]: Abstraction has 45993 states and 167804 transitions. [2019-12-28 03:41:15,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:41:15,024 INFO L276 IsEmpty]: Start isEmpty. Operand 45993 states and 167804 transitions. [2019-12-28 03:41:15,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-28 03:41:15,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:15,058 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] [2019-12-28 03:41:15,059 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:15,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:15,059 INFO L82 PathProgramCache]: Analyzing trace with hash 796822408, now seen corresponding path program 1 times [2019-12-28 03:41:15,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:15,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428439486] [2019-12-28 03:41:15,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:15,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:41:15,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428439486] [2019-12-28 03:41:15,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:15,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:41:15,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1886451634] [2019-12-28 03:41:15,180 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:15,191 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:15,204 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 74 transitions. [2019-12-28 03:41:15,204 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:15,205 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:41:15,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:41:15,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:15,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:41:15,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:41:15,206 INFO L87 Difference]: Start difference. First operand 45993 states and 167804 transitions. Second operand 6 states. [2019-12-28 03:41:16,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:16,489 INFO L93 Difference]: Finished difference Result 65553 states and 237331 transitions. [2019-12-28 03:41:16,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:41:16,490 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-12-28 03:41:16,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:16,637 INFO L225 Difference]: With dead ends: 65553 [2019-12-28 03:41:16,637 INFO L226 Difference]: Without dead ends: 64909 [2019-12-28 03:41:16,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:41:16,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64909 states. [2019-12-28 03:41:17,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64909 to 56043. [2019-12-28 03:41:17,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56043 states. [2019-12-28 03:41:20,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56043 states to 56043 states and 204334 transitions. [2019-12-28 03:41:20,672 INFO L78 Accepts]: Start accepts. Automaton has 56043 states and 204334 transitions. Word has length 70 [2019-12-28 03:41:20,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:20,672 INFO L462 AbstractCegarLoop]: Abstraction has 56043 states and 204334 transitions. [2019-12-28 03:41:20,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:41:20,673 INFO L276 IsEmpty]: Start isEmpty. Operand 56043 states and 204334 transitions. [2019-12-28 03:41:20,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-28 03:41:20,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:20,723 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] [2019-12-28 03:41:20,723 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:20,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:20,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1758436425, now seen corresponding path program 1 times [2019-12-28 03:41:20,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:20,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991495905] [2019-12-28 03:41:20,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:20,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:41:20,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991495905] [2019-12-28 03:41:20,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:20,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:41:20,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [605544825] [2019-12-28 03:41:20,829 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:20,840 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:20,852 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 74 transitions. [2019-12-28 03:41:20,852 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:20,852 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:41:20,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:41:20,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:20,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:41:20,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:41:20,854 INFO L87 Difference]: Start difference. First operand 56043 states and 204334 transitions. Second operand 7 states. [2019-12-28 03:41:22,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:22,020 INFO L93 Difference]: Finished difference Result 83031 states and 292762 transitions. [2019-12-28 03:41:22,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 03:41:22,021 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-12-28 03:41:22,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:22,197 INFO L225 Difference]: With dead ends: 83031 [2019-12-28 03:41:22,198 INFO L226 Difference]: Without dead ends: 83031 [2019-12-28 03:41:22,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-28 03:41:22,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83031 states. [2019-12-28 03:41:23,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83031 to 76080. [2019-12-28 03:41:23,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76080 states. [2019-12-28 03:41:23,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76080 states to 76080 states and 270629 transitions. [2019-12-28 03:41:23,894 INFO L78 Accepts]: Start accepts. Automaton has 76080 states and 270629 transitions. Word has length 70 [2019-12-28 03:41:23,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:23,895 INFO L462 AbstractCegarLoop]: Abstraction has 76080 states and 270629 transitions. [2019-12-28 03:41:23,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:41:23,895 INFO L276 IsEmpty]: Start isEmpty. Operand 76080 states and 270629 transitions. [2019-12-28 03:41:23,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-28 03:41:23,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:23,971 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] [2019-12-28 03:41:23,971 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:23,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:23,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1291766390, now seen corresponding path program 1 times [2019-12-28 03:41:23,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:23,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992182812] [2019-12-28 03:41:23,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:24,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:41:24,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992182812] [2019-12-28 03:41:24,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:24,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:41:24,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1734141834] [2019-12-28 03:41:24,022 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:24,033 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:24,045 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 74 transitions. [2019-12-28 03:41:24,045 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:24,045 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:41:24,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:41:24,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:24,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:41:24,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:41:24,046 INFO L87 Difference]: Start difference. First operand 76080 states and 270629 transitions. Second operand 3 states. [2019-12-28 03:41:24,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:24,328 INFO L93 Difference]: Finished difference Result 54416 states and 197410 transitions. [2019-12-28 03:41:24,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:41:24,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-28 03:41:24,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:24,440 INFO L225 Difference]: With dead ends: 54416 [2019-12-28 03:41:24,440 INFO L226 Difference]: Without dead ends: 54254 [2019-12-28 03:41:24,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:41:25,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54254 states. [2019-12-28 03:41:25,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54254 to 54214. [2019-12-28 03:41:25,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54214 states. [2019-12-28 03:41:26,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54214 states to 54214 states and 196825 transitions. [2019-12-28 03:41:26,029 INFO L78 Accepts]: Start accepts. Automaton has 54214 states and 196825 transitions. Word has length 70 [2019-12-28 03:41:26,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:26,030 INFO L462 AbstractCegarLoop]: Abstraction has 54214 states and 196825 transitions. [2019-12-28 03:41:26,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:41:26,030 INFO L276 IsEmpty]: Start isEmpty. Operand 54214 states and 196825 transitions. [2019-12-28 03:41:26,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 03:41:26,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:26,066 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] [2019-12-28 03:41:26,067 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:26,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:26,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1538482368, now seen corresponding path program 1 times [2019-12-28 03:41:26,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:26,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502472399] [2019-12-28 03:41:26,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:26,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:41:26,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502472399] [2019-12-28 03:41:26,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:26,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:41:26,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [27867257] [2019-12-28 03:41:26,155 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:26,166 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:26,178 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 71 transitions. [2019-12-28 03:41:26,178 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:26,179 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:41:26,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:41:26,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:26,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:41:26,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:41:26,180 INFO L87 Difference]: Start difference. First operand 54214 states and 196825 transitions. Second operand 5 states. [2019-12-28 03:41:26,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:26,969 INFO L93 Difference]: Finished difference Result 84429 states and 303657 transitions. [2019-12-28 03:41:26,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 03:41:26,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-28 03:41:26,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:27,741 INFO L225 Difference]: With dead ends: 84429 [2019-12-28 03:41:27,741 INFO L226 Difference]: Without dead ends: 84233 [2019-12-28 03:41:27,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:41:28,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84233 states. [2019-12-28 03:41:28,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84233 to 76148. [2019-12-28 03:41:28,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76148 states. [2019-12-28 03:41:32,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76148 states to 76148 states and 275545 transitions. [2019-12-28 03:41:32,766 INFO L78 Accepts]: Start accepts. Automaton has 76148 states and 275545 transitions. Word has length 71 [2019-12-28 03:41:32,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:32,767 INFO L462 AbstractCegarLoop]: Abstraction has 76148 states and 275545 transitions. [2019-12-28 03:41:32,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:41:32,767 INFO L276 IsEmpty]: Start isEmpty. Operand 76148 states and 275545 transitions. [2019-12-28 03:41:32,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 03:41:32,828 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:32,828 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] [2019-12-28 03:41:32,828 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:32,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:32,828 INFO L82 PathProgramCache]: Analyzing trace with hash -293717887, now seen corresponding path program 1 times [2019-12-28 03:41:32,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:32,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018801514] [2019-12-28 03:41:32,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:32,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:32,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:41:32,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018801514] [2019-12-28 03:41:32,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:32,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:41:32,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1056264267] [2019-12-28 03:41:32,950 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:32,973 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:32,999 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 71 transitions. [2019-12-28 03:41:33,000 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:33,000 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:41:33,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:41:33,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:33,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:41:33,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:41:33,001 INFO L87 Difference]: Start difference. First operand 76148 states and 275545 transitions. Second operand 5 states. [2019-12-28 03:41:33,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:33,105 INFO L93 Difference]: Finished difference Result 19616 states and 62266 transitions. [2019-12-28 03:41:33,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 03:41:33,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-28 03:41:33,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:33,134 INFO L225 Difference]: With dead ends: 19616 [2019-12-28 03:41:33,134 INFO L226 Difference]: Without dead ends: 19138 [2019-12-28 03:41:33,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:41:33,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19138 states. [2019-12-28 03:41:33,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19138 to 19126. [2019-12-28 03:41:33,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19126 states. [2019-12-28 03:41:33,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19126 states to 19126 states and 60761 transitions. [2019-12-28 03:41:33,378 INFO L78 Accepts]: Start accepts. Automaton has 19126 states and 60761 transitions. Word has length 71 [2019-12-28 03:41:33,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:33,379 INFO L462 AbstractCegarLoop]: Abstraction has 19126 states and 60761 transitions. [2019-12-28 03:41:33,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:41:33,379 INFO L276 IsEmpty]: Start isEmpty. Operand 19126 states and 60761 transitions. [2019-12-28 03:41:33,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-28 03:41:33,394 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:33,394 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] [2019-12-28 03:41:33,394 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:33,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:33,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1162099754, now seen corresponding path program 1 times [2019-12-28 03:41:33,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:33,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997685540] [2019-12-28 03:41:33,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:33,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 03:41:33,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997685540] [2019-12-28 03:41:33,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:33,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:41:33,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1184469941] [2019-12-28 03:41:33,447 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:33,463 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:33,511 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 184 transitions. [2019-12-28 03:41:33,511 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:33,553 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 03:41:33,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:41:33,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:33,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:41:33,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:41:33,554 INFO L87 Difference]: Start difference. First operand 19126 states and 60761 transitions. Second operand 6 states. [2019-12-28 03:41:33,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:33,924 INFO L93 Difference]: Finished difference Result 24076 states and 75429 transitions. [2019-12-28 03:41:33,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:41:33,925 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-12-28 03:41:33,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:33,963 INFO L225 Difference]: With dead ends: 24076 [2019-12-28 03:41:33,964 INFO L226 Difference]: Without dead ends: 24076 [2019-12-28 03:41:33,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:41:34,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24076 states. [2019-12-28 03:41:34,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24076 to 19966. [2019-12-28 03:41:34,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19966 states. [2019-12-28 03:41:34,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19966 states to 19966 states and 63128 transitions. [2019-12-28 03:41:34,249 INFO L78 Accepts]: Start accepts. Automaton has 19966 states and 63128 transitions. Word has length 80 [2019-12-28 03:41:34,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:34,249 INFO L462 AbstractCegarLoop]: Abstraction has 19966 states and 63128 transitions. [2019-12-28 03:41:34,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:41:34,249 INFO L276 IsEmpty]: Start isEmpty. Operand 19966 states and 63128 transitions. [2019-12-28 03:41:34,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-28 03:41:34,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:34,264 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] [2019-12-28 03:41:34,264 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:34,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:34,265 INFO L82 PathProgramCache]: Analyzing trace with hash 907363209, now seen corresponding path program 1 times [2019-12-28 03:41:34,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:34,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497158905] [2019-12-28 03:41:34,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:34,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 03:41:34,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497158905] [2019-12-28 03:41:34,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:34,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 03:41:34,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1733982025] [2019-12-28 03:41:34,362 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:34,377 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:34,422 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 184 transitions. [2019-12-28 03:41:34,422 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:34,452 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:41:34,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 03:41:34,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:34,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 03:41:34,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:41:34,454 INFO L87 Difference]: Start difference. First operand 19966 states and 63128 transitions. Second operand 9 states. [2019-12-28 03:41:35,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:35,441 INFO L93 Difference]: Finished difference Result 22072 states and 69320 transitions. [2019-12-28 03:41:35,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-28 03:41:35,441 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-12-28 03:41:35,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:35,475 INFO L225 Difference]: With dead ends: 22072 [2019-12-28 03:41:35,475 INFO L226 Difference]: Without dead ends: 22024 [2019-12-28 03:41:35,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2019-12-28 03:41:35,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22024 states. [2019-12-28 03:41:35,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22024 to 19438. [2019-12-28 03:41:35,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19438 states. [2019-12-28 03:41:35,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19438 states to 19438 states and 61630 transitions. [2019-12-28 03:41:35,937 INFO L78 Accepts]: Start accepts. Automaton has 19438 states and 61630 transitions. Word has length 80 [2019-12-28 03:41:35,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:35,937 INFO L462 AbstractCegarLoop]: Abstraction has 19438 states and 61630 transitions. [2019-12-28 03:41:35,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 03:41:35,937 INFO L276 IsEmpty]: Start isEmpty. Operand 19438 states and 61630 transitions. [2019-12-28 03:41:35,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 03:41:35,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:35,953 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] [2019-12-28 03:41:35,953 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:35,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:35,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1999994915, now seen corresponding path program 1 times [2019-12-28 03:41:35,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:35,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771415498] [2019-12-28 03:41:35,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:36,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:41:36,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771415498] [2019-12-28 03:41:36,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:36,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 03:41:36,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [308879909] [2019-12-28 03:41:36,049 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:36,065 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:36,090 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 93 transitions. [2019-12-28 03:41:36,090 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:36,091 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:41:36,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:41:36,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:36,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:41:36,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:41:36,092 INFO L87 Difference]: Start difference. First operand 19438 states and 61630 transitions. Second operand 8 states. [2019-12-28 03:41:38,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:38,960 INFO L93 Difference]: Finished difference Result 50432 states and 153648 transitions. [2019-12-28 03:41:38,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-28 03:41:38,961 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2019-12-28 03:41:38,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:39,101 INFO L225 Difference]: With dead ends: 50432 [2019-12-28 03:41:39,101 INFO L226 Difference]: Without dead ends: 49733 [2019-12-28 03:41:39,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-12-28 03:41:39,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49733 states. [2019-12-28 03:41:39,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49733 to 29966. [2019-12-28 03:41:39,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29966 states. [2019-12-28 03:41:40,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29966 states to 29966 states and 93560 transitions. [2019-12-28 03:41:40,040 INFO L78 Accepts]: Start accepts. Automaton has 29966 states and 93560 transitions. Word has length 83 [2019-12-28 03:41:40,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:40,041 INFO L462 AbstractCegarLoop]: Abstraction has 29966 states and 93560 transitions. [2019-12-28 03:41:40,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:41:40,041 INFO L276 IsEmpty]: Start isEmpty. Operand 29966 states and 93560 transitions. [2019-12-28 03:41:40,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 03:41:40,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:40,099 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] [2019-12-28 03:41:40,099 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:40,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:40,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1038380898, now seen corresponding path program 1 times [2019-12-28 03:41:40,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:40,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932741830] [2019-12-28 03:41:40,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:40,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:41:40,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932741830] [2019-12-28 03:41:40,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:40,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:41:40,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2005506594] [2019-12-28 03:41:40,244 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:40,274 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:40,311 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 93 transitions. [2019-12-28 03:41:40,311 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:40,314 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 03:41:40,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:41:40,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:40,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:41:40,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:41:40,316 INFO L87 Difference]: Start difference. First operand 29966 states and 93560 transitions. Second operand 6 states. [2019-12-28 03:41:41,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:41,286 INFO L93 Difference]: Finished difference Result 31404 states and 97497 transitions. [2019-12-28 03:41:41,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:41:41,286 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-12-28 03:41:41,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:41,360 INFO L225 Difference]: With dead ends: 31404 [2019-12-28 03:41:41,360 INFO L226 Difference]: Without dead ends: 31404 [2019-12-28 03:41:41,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:41:41,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31404 states. [2019-12-28 03:41:41,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31404 to 29635. [2019-12-28 03:41:41,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29635 states. [2019-12-28 03:41:41,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29635 states to 29635 states and 92403 transitions. [2019-12-28 03:41:41,809 INFO L78 Accepts]: Start accepts. Automaton has 29635 states and 92403 transitions. Word has length 83 [2019-12-28 03:41:41,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:41,809 INFO L462 AbstractCegarLoop]: Abstraction has 29635 states and 92403 transitions. [2019-12-28 03:41:41,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:41:41,809 INFO L276 IsEmpty]: Start isEmpty. Operand 29635 states and 92403 transitions. [2019-12-28 03:41:41,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 03:41:41,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:41,834 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:41:41,834 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:41,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:41,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1320926111, now seen corresponding path program 1 times [2019-12-28 03:41:41,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:41,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566827449] [2019-12-28 03:41:41,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:41,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:41:41,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566827449] [2019-12-28 03:41:41,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:41,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:41:41,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [800815493] [2019-12-28 03:41:41,933 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:41,948 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:41,972 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 93 transitions. [2019-12-28 03:41:41,972 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:41,976 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 03:41:41,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:41:41,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:41,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:41:41,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:41:41,978 INFO L87 Difference]: Start difference. First operand 29635 states and 92403 transitions. Second operand 7 states. [2019-12-28 03:41:42,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:42,565 INFO L93 Difference]: Finished difference Result 31149 states and 96559 transitions. [2019-12-28 03:41:42,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 03:41:42,566 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-12-28 03:41:42,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:42,613 INFO L225 Difference]: With dead ends: 31149 [2019-12-28 03:41:42,613 INFO L226 Difference]: Without dead ends: 31149 [2019-12-28 03:41:42,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-28 03:41:42,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31149 states. [2019-12-28 03:41:42,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31149 to 29967. [2019-12-28 03:41:42,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29967 states. [2019-12-28 03:41:43,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29967 states to 29967 states and 93234 transitions. [2019-12-28 03:41:43,015 INFO L78 Accepts]: Start accepts. Automaton has 29967 states and 93234 transitions. Word has length 83 [2019-12-28 03:41:43,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:43,015 INFO L462 AbstractCegarLoop]: Abstraction has 29967 states and 93234 transitions. [2019-12-28 03:41:43,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:41:43,015 INFO L276 IsEmpty]: Start isEmpty. Operand 29967 states and 93234 transitions. [2019-12-28 03:41:43,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 03:41:43,044 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:43,044 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] [2019-12-28 03:41:43,044 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:43,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:43,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1650691872, now seen corresponding path program 1 times [2019-12-28 03:41:43,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:43,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340513946] [2019-12-28 03:41:43,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:43,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:41:43,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340513946] [2019-12-28 03:41:43,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:43,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:41:43,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [873103341] [2019-12-28 03:41:43,114 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:43,129 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:43,153 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 93 transitions. [2019-12-28 03:41:43,153 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:43,154 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:41:43,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:41:43,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:43,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:41:43,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:41:43,155 INFO L87 Difference]: Start difference. First operand 29967 states and 93234 transitions. Second operand 5 states. [2019-12-28 03:41:43,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:43,206 INFO L93 Difference]: Finished difference Result 4530 states and 11170 transitions. [2019-12-28 03:41:43,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 03:41:43,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-12-28 03:41:43,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:43,212 INFO L225 Difference]: With dead ends: 4530 [2019-12-28 03:41:43,212 INFO L226 Difference]: Without dead ends: 3740 [2019-12-28 03:41:43,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:41:43,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3740 states. [2019-12-28 03:41:43,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3740 to 3437. [2019-12-28 03:41:43,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3437 states. [2019-12-28 03:41:43,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3437 states to 3437 states and 8371 transitions. [2019-12-28 03:41:43,252 INFO L78 Accepts]: Start accepts. Automaton has 3437 states and 8371 transitions. Word has length 83 [2019-12-28 03:41:43,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:43,253 INFO L462 AbstractCegarLoop]: Abstraction has 3437 states and 8371 transitions. [2019-12-28 03:41:43,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:41:43,253 INFO L276 IsEmpty]: Start isEmpty. Operand 3437 states and 8371 transitions. [2019-12-28 03:41:43,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 03:41:43,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:43,256 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:41:43,256 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:43,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:43,256 INFO L82 PathProgramCache]: Analyzing trace with hash -843880616, now seen corresponding path program 1 times [2019-12-28 03:41:43,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:43,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267557619] [2019-12-28 03:41:43,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:43,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:41:43,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267557619] [2019-12-28 03:41:43,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:43,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:41:43,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1350435882] [2019-12-28 03:41:43,373 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:43,403 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:43,474 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 128 states and 159 transitions. [2019-12-28 03:41:43,475 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:43,515 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 03:41:43,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:41:43,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:43,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:41:43,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:41:43,516 INFO L87 Difference]: Start difference. First operand 3437 states and 8371 transitions. Second operand 8 states. [2019-12-28 03:41:44,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:44,854 INFO L93 Difference]: Finished difference Result 7412 states and 17652 transitions. [2019-12-28 03:41:44,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-28 03:41:44,855 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-12-28 03:41:44,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:44,864 INFO L225 Difference]: With dead ends: 7412 [2019-12-28 03:41:44,865 INFO L226 Difference]: Without dead ends: 7338 [2019-12-28 03:41:44,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-12-28 03:41:44,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7338 states. [2019-12-28 03:41:44,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7338 to 3789. [2019-12-28 03:41:44,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3789 states. [2019-12-28 03:41:44,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3789 states to 3789 states and 9126 transitions. [2019-12-28 03:41:44,916 INFO L78 Accepts]: Start accepts. Automaton has 3789 states and 9126 transitions. Word has length 95 [2019-12-28 03:41:44,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:44,916 INFO L462 AbstractCegarLoop]: Abstraction has 3789 states and 9126 transitions. [2019-12-28 03:41:44,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:41:44,916 INFO L276 IsEmpty]: Start isEmpty. Operand 3789 states and 9126 transitions. [2019-12-28 03:41:44,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 03:41:44,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:44,920 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:41:44,920 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:44,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:44,920 INFO L82 PathProgramCache]: Analyzing trace with hash 285188987, now seen corresponding path program 1 times [2019-12-28 03:41:44,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:44,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085249394] [2019-12-28 03:41:44,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:45,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:41:45,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085249394] [2019-12-28 03:41:45,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:45,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:41:45,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1164760309] [2019-12-28 03:41:45,011 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:45,034 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:45,094 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 169 transitions. [2019-12-28 03:41:45,095 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:45,153 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-28 03:41:45,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:41:45,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:45,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:41:45,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:41:45,155 INFO L87 Difference]: Start difference. First operand 3789 states and 9126 transitions. Second operand 8 states. [2019-12-28 03:41:46,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:46,387 INFO L93 Difference]: Finished difference Result 6447 states and 15473 transitions. [2019-12-28 03:41:46,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-28 03:41:46,388 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-12-28 03:41:46,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:46,396 INFO L225 Difference]: With dead ends: 6447 [2019-12-28 03:41:46,396 INFO L226 Difference]: Without dead ends: 6390 [2019-12-28 03:41:46,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-12-28 03:41:46,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6390 states. [2019-12-28 03:41:46,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6390 to 4043. [2019-12-28 03:41:46,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4043 states. [2019-12-28 03:41:46,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4043 states to 4043 states and 9666 transitions. [2019-12-28 03:41:46,445 INFO L78 Accepts]: Start accepts. Automaton has 4043 states and 9666 transitions. Word has length 95 [2019-12-28 03:41:46,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:46,445 INFO L462 AbstractCegarLoop]: Abstraction has 4043 states and 9666 transitions. [2019-12-28 03:41:46,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:41:46,445 INFO L276 IsEmpty]: Start isEmpty. Operand 4043 states and 9666 transitions. [2019-12-28 03:41:46,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 03:41:46,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:46,449 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:41:46,449 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:46,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:46,450 INFO L82 PathProgramCache]: Analyzing trace with hash -637494596, now seen corresponding path program 1 times [2019-12-28 03:41:46,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:46,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714482343] [2019-12-28 03:41:46,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:46,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:41:46,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714482343] [2019-12-28 03:41:46,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:46,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:41:46,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1927367642] [2019-12-28 03:41:46,559 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:46,582 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:46,636 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 169 transitions. [2019-12-28 03:41:46,636 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:46,656 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 03:41:46,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:41:46,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:46,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:41:46,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:41:46,657 INFO L87 Difference]: Start difference. First operand 4043 states and 9666 transitions. Second operand 8 states. [2019-12-28 03:41:47,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:47,847 INFO L93 Difference]: Finished difference Result 8893 states and 20608 transitions. [2019-12-28 03:41:47,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-28 03:41:47,848 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-12-28 03:41:47,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:47,858 INFO L225 Difference]: With dead ends: 8893 [2019-12-28 03:41:47,858 INFO L226 Difference]: Without dead ends: 8773 [2019-12-28 03:41:47,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-12-28 03:41:47,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8773 states. [2019-12-28 03:41:47,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8773 to 4263. [2019-12-28 03:41:47,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4263 states. [2019-12-28 03:41:47,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4263 states to 4263 states and 10155 transitions. [2019-12-28 03:41:47,918 INFO L78 Accepts]: Start accepts. Automaton has 4263 states and 10155 transitions. Word has length 95 [2019-12-28 03:41:47,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:47,918 INFO L462 AbstractCegarLoop]: Abstraction has 4263 states and 10155 transitions. [2019-12-28 03:41:47,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:41:47,918 INFO L276 IsEmpty]: Start isEmpty. Operand 4263 states and 10155 transitions. [2019-12-28 03:41:47,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 03:41:47,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:47,922 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:41:47,922 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:47,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:47,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1721812413, now seen corresponding path program 1 times [2019-12-28 03:41:47,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:47,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478010036] [2019-12-28 03:41:47,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:48,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:41:48,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478010036] [2019-12-28 03:41:48,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:48,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:41:48,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1580607765] [2019-12-28 03:41:48,013 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:48,035 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:48,095 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 169 transitions. [2019-12-28 03:41:48,095 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:48,122 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 03:41:48,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:41:48,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:48,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:41:48,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:41:48,123 INFO L87 Difference]: Start difference. First operand 4263 states and 10155 transitions. Second operand 8 states. [2019-12-28 03:41:48,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:48,623 INFO L93 Difference]: Finished difference Result 7913 states and 18703 transitions. [2019-12-28 03:41:48,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 03:41:48,624 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-12-28 03:41:48,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:48,633 INFO L225 Difference]: With dead ends: 7913 [2019-12-28 03:41:48,633 INFO L226 Difference]: Without dead ends: 7885 [2019-12-28 03:41:48,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-12-28 03:41:48,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7885 states. [2019-12-28 03:41:48,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7885 to 4347. [2019-12-28 03:41:48,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4347 states. [2019-12-28 03:41:48,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4347 states to 4347 states and 10224 transitions. [2019-12-28 03:41:48,690 INFO L78 Accepts]: Start accepts. Automaton has 4347 states and 10224 transitions. Word has length 95 [2019-12-28 03:41:48,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:48,690 INFO L462 AbstractCegarLoop]: Abstraction has 4347 states and 10224 transitions. [2019-12-28 03:41:48,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:41:48,690 INFO L276 IsEmpty]: Start isEmpty. Operand 4347 states and 10224 transitions. [2019-12-28 03:41:48,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 03:41:48,694 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:48,694 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:41:48,694 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:48,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:48,694 INFO L82 PathProgramCache]: Analyzing trace with hash 2051578174, now seen corresponding path program 1 times [2019-12-28 03:41:48,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:48,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047477368] [2019-12-28 03:41:48,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:48,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:41:48,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047477368] [2019-12-28 03:41:48,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:48,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:41:48,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [719129803] [2019-12-28 03:41:48,761 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:48,792 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:48,856 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 169 transitions. [2019-12-28 03:41:48,856 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:48,858 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:41:48,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:41:48,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:48,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:41:48,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:41:48,859 INFO L87 Difference]: Start difference. First operand 4347 states and 10224 transitions. Second operand 6 states. [2019-12-28 03:41:49,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:49,229 INFO L93 Difference]: Finished difference Result 4789 states and 11142 transitions. [2019-12-28 03:41:49,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 03:41:49,229 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-28 03:41:49,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:49,235 INFO L225 Difference]: With dead ends: 4789 [2019-12-28 03:41:49,235 INFO L226 Difference]: Without dead ends: 4789 [2019-12-28 03:41:49,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-28 03:41:49,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4789 states. [2019-12-28 03:41:49,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4789 to 4028. [2019-12-28 03:41:49,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4028 states. [2019-12-28 03:41:49,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4028 states to 4028 states and 9471 transitions. [2019-12-28 03:41:49,282 INFO L78 Accepts]: Start accepts. Automaton has 4028 states and 9471 transitions. Word has length 95 [2019-12-28 03:41:49,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:49,283 INFO L462 AbstractCegarLoop]: Abstraction has 4028 states and 9471 transitions. [2019-12-28 03:41:49,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:41:49,283 INFO L276 IsEmpty]: Start isEmpty. Operand 4028 states and 9471 transitions. [2019-12-28 03:41:49,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 03:41:49,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:49,287 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:41:49,287 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:49,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:49,287 INFO L82 PathProgramCache]: Analyzing trace with hash 41474333, now seen corresponding path program 1 times [2019-12-28 03:41:49,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:49,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290206402] [2019-12-28 03:41:49,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:41:49,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290206402] [2019-12-28 03:41:49,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:49,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:41:49,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1259304193] [2019-12-28 03:41:49,356 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:49,372 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:49,450 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 168 transitions. [2019-12-28 03:41:49,450 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:49,451 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:41:49,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:41:49,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:49,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:41:49,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:41:49,452 INFO L87 Difference]: Start difference. First operand 4028 states and 9471 transitions. Second operand 4 states. [2019-12-28 03:41:49,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:49,756 INFO L93 Difference]: Finished difference Result 4334 states and 10167 transitions. [2019-12-28 03:41:49,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:41:49,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-28 03:41:49,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:49,765 INFO L225 Difference]: With dead ends: 4334 [2019-12-28 03:41:49,765 INFO L226 Difference]: Without dead ends: 4298 [2019-12-28 03:41:49,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:41:49,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4298 states. [2019-12-28 03:41:49,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4298 to 4028. [2019-12-28 03:41:49,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4028 states. [2019-12-28 03:41:49,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4028 states to 4028 states and 9453 transitions. [2019-12-28 03:41:49,834 INFO L78 Accepts]: Start accepts. Automaton has 4028 states and 9453 transitions. Word has length 95 [2019-12-28 03:41:49,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:49,835 INFO L462 AbstractCegarLoop]: Abstraction has 4028 states and 9453 transitions. [2019-12-28 03:41:49,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:41:49,835 INFO L276 IsEmpty]: Start isEmpty. Operand 4028 states and 9453 transitions. [2019-12-28 03:41:49,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 03:41:49,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:49,840 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:41:49,840 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:49,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:49,840 INFO L82 PathProgramCache]: Analyzing trace with hash -241676131, now seen corresponding path program 1 times [2019-12-28 03:41:49,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:49,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725236677] [2019-12-28 03:41:49,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:49,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:41:49,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725236677] [2019-12-28 03:41:49,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:49,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:41:49,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1822805374] [2019-12-28 03:41:49,927 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:49,945 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:50,007 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 168 transitions. [2019-12-28 03:41:50,007 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:50,026 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 03:41:50,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:41:50,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:50,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:41:50,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:41:50,029 INFO L87 Difference]: Start difference. First operand 4028 states and 9453 transitions. Second operand 6 states. [2019-12-28 03:41:50,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:50,343 INFO L93 Difference]: Finished difference Result 3848 states and 8889 transitions. [2019-12-28 03:41:50,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:41:50,344 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-28 03:41:50,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:50,352 INFO L225 Difference]: With dead ends: 3848 [2019-12-28 03:41:50,352 INFO L226 Difference]: Without dead ends: 3830 [2019-12-28 03:41:50,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:41:50,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3830 states. [2019-12-28 03:41:50,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3830 to 2749. [2019-12-28 03:41:50,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2749 states. [2019-12-28 03:41:50,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2749 states to 2749 states and 6406 transitions. [2019-12-28 03:41:50,414 INFO L78 Accepts]: Start accepts. Automaton has 2749 states and 6406 transitions. Word has length 95 [2019-12-28 03:41:50,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:50,415 INFO L462 AbstractCegarLoop]: Abstraction has 2749 states and 6406 transitions. [2019-12-28 03:41:50,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:41:50,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2749 states and 6406 transitions. [2019-12-28 03:41:50,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 03:41:50,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:50,421 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:41:50,421 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:50,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:50,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1003088350, now seen corresponding path program 1 times [2019-12-28 03:41:50,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:50,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473274024] [2019-12-28 03:41:50,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:50,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:41:50,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473274024] [2019-12-28 03:41:50,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:50,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:41:50,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [421516595] [2019-12-28 03:41:50,501 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:50,519 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:50,587 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 168 transitions. [2019-12-28 03:41:50,587 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:50,589 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:41:50,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:41:50,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:50,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:41:50,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:41:50,590 INFO L87 Difference]: Start difference. First operand 2749 states and 6406 transitions. Second operand 3 states. [2019-12-28 03:41:50,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:50,614 INFO L93 Difference]: Finished difference Result 2453 states and 5692 transitions. [2019-12-28 03:41:50,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:41:50,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-12-28 03:41:50,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:50,618 INFO L225 Difference]: With dead ends: 2453 [2019-12-28 03:41:50,618 INFO L226 Difference]: Without dead ends: 2435 [2019-12-28 03:41:50,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:41:50,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2019-12-28 03:41:50,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 2265. [2019-12-28 03:41:50,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2265 states. [2019-12-28 03:41:50,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 2265 states and 5296 transitions. [2019-12-28 03:41:50,649 INFO L78 Accepts]: Start accepts. Automaton has 2265 states and 5296 transitions. Word has length 95 [2019-12-28 03:41:50,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:50,650 INFO L462 AbstractCegarLoop]: Abstraction has 2265 states and 5296 transitions. [2019-12-28 03:41:50,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:41:50,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2265 states and 5296 transitions. [2019-12-28 03:41:50,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 03:41:50,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:50,653 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:41:50,653 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:50,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:50,653 INFO L82 PathProgramCache]: Analyzing trace with hash 756751223, now seen corresponding path program 1 times [2019-12-28 03:41:50,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:50,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65347853] [2019-12-28 03:41:50,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:50,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:41:50,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65347853] [2019-12-28 03:41:50,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:50,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:41:50,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1885629159] [2019-12-28 03:41:50,750 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:50,771 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:50,843 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 143 states and 187 transitions. [2019-12-28 03:41:50,844 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:50,874 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-28 03:41:50,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:41:50,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:50,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:41:50,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:41:50,875 INFO L87 Difference]: Start difference. First operand 2265 states and 5296 transitions. Second operand 7 states. [2019-12-28 03:41:51,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:51,088 INFO L93 Difference]: Finished difference Result 2257 states and 5272 transitions. [2019-12-28 03:41:51,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 03:41:51,089 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-28 03:41:51,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:51,093 INFO L225 Difference]: With dead ends: 2257 [2019-12-28 03:41:51,093 INFO L226 Difference]: Without dead ends: 2257 [2019-12-28 03:41:51,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:41:51,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2019-12-28 03:41:51,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2184. [2019-12-28 03:41:51,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2184 states. [2019-12-28 03:41:51,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 2184 states and 5106 transitions. [2019-12-28 03:41:51,133 INFO L78 Accepts]: Start accepts. Automaton has 2184 states and 5106 transitions. Word has length 97 [2019-12-28 03:41:51,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:51,134 INFO L462 AbstractCegarLoop]: Abstraction has 2184 states and 5106 transitions. [2019-12-28 03:41:51,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:41:51,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 5106 transitions. [2019-12-28 03:41:51,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 03:41:51,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:51,138 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:41:51,138 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:51,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:51,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1696531523, now seen corresponding path program 1 times [2019-12-28 03:41:51,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:51,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459104813] [2019-12-28 03:41:51,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:51,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:41:51,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459104813] [2019-12-28 03:41:51,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:51,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:41:51,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [807050102] [2019-12-28 03:41:51,256 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:51,281 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:51,374 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 205 transitions. [2019-12-28 03:41:51,375 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:51,426 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 03:41:51,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:41:51,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:51,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:41:51,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:41:51,427 INFO L87 Difference]: Start difference. First operand 2184 states and 5106 transitions. Second operand 8 states. [2019-12-28 03:41:51,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:51,748 INFO L93 Difference]: Finished difference Result 3550 states and 8326 transitions. [2019-12-28 03:41:51,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:41:51,749 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-28 03:41:51,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:51,753 INFO L225 Difference]: With dead ends: 3550 [2019-12-28 03:41:51,753 INFO L226 Difference]: Without dead ends: 3550 [2019-12-28 03:41:51,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-12-28 03:41:51,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3550 states. [2019-12-28 03:41:51,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3550 to 2146. [2019-12-28 03:41:51,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2146 states. [2019-12-28 03:41:51,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 4970 transitions. [2019-12-28 03:41:51,777 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 4970 transitions. Word has length 97 [2019-12-28 03:41:51,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:51,778 INFO L462 AbstractCegarLoop]: Abstraction has 2146 states and 4970 transitions. [2019-12-28 03:41:51,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:41:51,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 4970 transitions. [2019-12-28 03:41:51,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 03:41:51,779 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:51,779 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:41:51,780 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:51,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:51,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1415088476, now seen corresponding path program 1 times [2019-12-28 03:41:51,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:51,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724358992] [2019-12-28 03:41:51,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:51,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:41:51,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724358992] [2019-12-28 03:41:51,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:51,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 03:41:51,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1244384998] [2019-12-28 03:41:51,897 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:51,913 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:51,981 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 205 transitions. [2019-12-28 03:41:51,981 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:52,000 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:41:52,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 03:41:52,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:52,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 03:41:52,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:41:52,001 INFO L87 Difference]: Start difference. First operand 2146 states and 4970 transitions. Second operand 9 states. [2019-12-28 03:41:52,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:52,234 INFO L93 Difference]: Finished difference Result 3515 states and 8250 transitions. [2019-12-28 03:41:52,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 03:41:52,234 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-12-28 03:41:52,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:52,236 INFO L225 Difference]: With dead ends: 3515 [2019-12-28 03:41:52,236 INFO L226 Difference]: Without dead ends: 1453 [2019-12-28 03:41:52,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-12-28 03:41:52,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2019-12-28 03:41:52,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1365. [2019-12-28 03:41:52,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1365 states. [2019-12-28 03:41:52,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 3237 transitions. [2019-12-28 03:41:52,255 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 3237 transitions. Word has length 97 [2019-12-28 03:41:52,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:52,255 INFO L462 AbstractCegarLoop]: Abstraction has 1365 states and 3237 transitions. [2019-12-28 03:41:52,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 03:41:52,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 3237 transitions. [2019-12-28 03:41:52,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 03:41:52,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:52,258 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:41:52,258 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:41:52,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:52,258 INFO L82 PathProgramCache]: Analyzing trace with hash -466492236, now seen corresponding path program 2 times [2019-12-28 03:41:52,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:52,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195981506] [2019-12-28 03:41:52,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 03:41:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 03:41:52,394 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 03:41:52,395 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 03:41:52,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 03:41:52 BasicIcfg [2019-12-28 03:41:52,607 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 03:41:52,609 INFO L168 Benchmark]: Toolchain (without parser) took 68384.47 ms. Allocated memory was 138.4 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 101.7 MB in the beginning and 1.1 GB in the end (delta: -959.1 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-28 03:41:52,609 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-28 03:41:52,610 INFO L168 Benchmark]: CACSL2BoogieTranslator took 766.67 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.3 MB in the beginning and 157.1 MB in the end (delta: -55.8 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2019-12-28 03:41:52,611 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.57 ms. Allocated memory is still 202.9 MB. Free memory was 157.1 MB in the beginning and 154.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-28 03:41:52,611 INFO L168 Benchmark]: Boogie Preprocessor took 39.26 ms. Allocated memory is still 202.9 MB. Free memory was 154.5 MB in the beginning and 151.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-28 03:41:52,611 INFO L168 Benchmark]: RCFGBuilder took 789.34 ms. Allocated memory is still 202.9 MB. Free memory was 151.8 MB in the beginning and 107.3 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2019-12-28 03:41:52,612 INFO L168 Benchmark]: TraceAbstraction took 66705.25 ms. Allocated memory was 202.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 107.3 MB in the beginning and 1.1 GB in the end (delta: -953.6 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-28 03:41:52,614 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.25 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 766.67 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.3 MB in the beginning and 157.1 MB in the end (delta: -55.8 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.57 ms. Allocated memory is still 202.9 MB. Free memory was 157.1 MB in the beginning and 154.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.26 ms. Allocated memory is still 202.9 MB. Free memory was 154.5 MB in the beginning and 151.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 789.34 ms. Allocated memory is still 202.9 MB. Free memory was 151.8 MB in the beginning and 107.3 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 66705.25 ms. Allocated memory was 202.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 107.3 MB in the beginning and 1.1 GB in the end (delta: -953.6 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L698] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L704] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L705] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L706] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L707] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L708] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L709] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L710] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L711] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L712] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L713] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L714] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L715] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L716] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L717] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L718] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L721] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L722] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 0 pthread_t t1611; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L789] FCALL, FORK 0 pthread_create(&t1611, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L790] 0 pthread_t t1612; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L791] FCALL, FORK 0 pthread_create(&t1612, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L746] 2 y$w_buff1 = y$w_buff0 [L747] 2 y$w_buff0 = 2 [L748] 2 y$w_buff1_used = y$w_buff0_used [L749] 2 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L751] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L752] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L753] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L754] 2 y$r_buff0_thd2 = (_Bool)1 [L757] 2 z = 1 [L760] 2 __unbuffered_p1_EAX = z [L763] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __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=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L726] 1 x = 1 [L729] 1 y = 1 VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, y=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, y=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=1, z=1] [L732] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, 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=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=1, z=1] [L732] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L733] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, y=1, 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=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, 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=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L735] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, y=1, 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=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L735] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, 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=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L736] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L739] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 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) [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 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 [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 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 [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 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) [L798] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L799] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 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 [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 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 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 y$flush_delayed = weak$$choice2 [L807] 0 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L809] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L810] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L811] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L812] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L814] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] 0 y = y$flush_delayed ? y$mem_tmp : y [L817] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, 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, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 66.3s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 25.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8198 SDtfs, 10710 SDslu, 21555 SDs, 0 SdLazy, 11435 SolverSat, 808 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 447 GetRequests, 143 SyntacticMatches, 25 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76148occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 32.9s AutomataMinimizationTime, 30 MinimizatonAttempts, 121977 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2437 NumberOfCodeBlocks, 2437 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2310 ConstructedInterpolants, 0 QuantifiedInterpolants, 442092 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...