/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_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 03:40:21,952 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 03:40:21,954 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 03:40:21,971 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 03:40:21,972 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 03:40:21,974 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 03:40:21,975 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 03:40:21,977 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 03:40:21,978 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 03:40:21,979 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 03:40:21,980 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 03:40:21,981 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 03:40:21,982 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 03:40:21,983 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 03:40:21,984 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 03:40:21,985 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 03:40:21,986 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 03:40:21,987 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 03:40:21,989 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 03:40:21,991 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 03:40:21,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 03:40:21,993 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 03:40:21,994 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 03:40:21,995 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 03:40:21,998 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 03:40:21,998 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 03:40:21,998 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 03:40:21,999 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 03:40:22,000 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 03:40:22,001 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 03:40:22,001 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 03:40:22,002 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 03:40:22,003 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 03:40:22,003 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 03:40:22,004 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 03:40:22,005 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 03:40:22,005 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 03:40:22,005 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 03:40:22,006 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 03:40:22,007 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 03:40:22,007 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 03:40:22,008 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:22,023 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 03:40:22,023 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 03:40:22,024 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 03:40:22,024 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 03:40:22,025 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 03:40:22,025 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 03:40:22,025 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 03:40:22,025 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 03:40:22,025 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 03:40:22,026 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 03:40:22,026 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 03:40:22,026 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 03:40:22,026 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 03:40:22,026 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 03:40:22,027 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 03:40:22,027 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 03:40:22,027 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 03:40:22,027 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 03:40:22,027 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 03:40:22,028 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 03:40:22,028 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 03:40:22,028 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 03:40:22,028 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 03:40:22,028 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 03:40:22,029 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 03:40:22,029 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 03:40:22,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 03:40:22,029 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 03:40:22,029 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 03:40:22,030 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 03:40:22,030 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 03:40:22,030 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 03:40:22,305 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 03:40:22,318 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 03:40:22,321 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 03:40:22,323 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 03:40:22,323 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 03:40:22,324 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_pso.opt.i [2019-12-28 03:40:22,394 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/088a83290/b008e2ce4f79400b9036bd6a5bf99a79/FLAG83d16a785 [2019-12-28 03:40:22,954 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 03:40:22,955 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_pso.opt.i [2019-12-28 03:40:22,973 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/088a83290/b008e2ce4f79400b9036bd6a5bf99a79/FLAG83d16a785 [2019-12-28 03:40:23,231 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/088a83290/b008e2ce4f79400b9036bd6a5bf99a79 [2019-12-28 03:40:23,241 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 03:40:23,243 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 03:40:23,245 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 03:40:23,245 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 03:40:23,249 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 03:40:23,253 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:40:23" (1/1) ... [2019-12-28 03:40:23,255 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85f7a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:40:23, skipping insertion in model container [2019-12-28 03:40:23,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:40:23" (1/1) ... [2019-12-28 03:40:23,266 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 03:40:23,328 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 03:40:23,915 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 03:40:23,929 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 03:40:24,001 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 03:40:24,078 INFO L208 MainTranslator]: Completed translation [2019-12-28 03:40:24,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:40:24 WrapperNode [2019-12-28 03:40:24,079 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 03:40:24,079 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 03:40:24,080 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 03:40:24,080 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 03:40:24,088 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:24" (1/1) ... [2019-12-28 03:40:24,108 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:24" (1/1) ... [2019-12-28 03:40:24,143 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 03:40:24,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 03:40:24,144 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 03:40:24,144 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 03:40:24,154 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:24" (1/1) ... [2019-12-28 03:40:24,155 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:24" (1/1) ... [2019-12-28 03:40:24,159 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:24" (1/1) ... [2019-12-28 03:40:24,160 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:24" (1/1) ... [2019-12-28 03:40:24,170 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:24" (1/1) ... [2019-12-28 03:40:24,173 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:24" (1/1) ... [2019-12-28 03:40:24,177 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:24" (1/1) ... [2019-12-28 03:40:24,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 03:40:24,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 03:40:24,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 03:40:24,183 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 03:40:24,184 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:40:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 03:40:24,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 03:40:24,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 03:40:24,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 03:40:24,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 03:40:24,259 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 03:40:24,259 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 03:40:24,259 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 03:40:24,259 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 03:40:24,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 03:40:24,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 03:40:24,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 03:40:24,262 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:24,941 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 03:40:24,942 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 03:40:24,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:40:24 BoogieIcfgContainer [2019-12-28 03:40:24,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 03:40:24,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 03:40:24,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 03:40:24,948 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 03:40:24,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 03:40:23" (1/3) ... [2019-12-28 03:40:24,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c6e069d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:40:24, skipping insertion in model container [2019-12-28 03:40:24,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:40:24" (2/3) ... [2019-12-28 03:40:24,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c6e069d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:40:24, skipping insertion in model container [2019-12-28 03:40:24,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:40:24" (3/3) ... [2019-12-28 03:40:24,952 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_pso.opt.i [2019-12-28 03:40:24,962 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 03:40:24,963 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 03:40:24,973 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 03:40:24,974 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 03:40:25,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,008 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,009 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,018 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,018 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,018 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:25,018 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,019 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,019 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,033 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,033 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,035 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,036 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,036 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,037 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:25,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:40:25,053 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 03:40:25,074 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 03:40:25,074 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 03:40:25,074 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 03:40:25,075 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 03:40:25,075 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 03:40:25,075 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 03:40:25,075 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 03:40:25,075 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 03:40:25,090 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 148 places, 182 transitions [2019-12-28 03:40:26,341 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22496 states. [2019-12-28 03:40:26,343 INFO L276 IsEmpty]: Start isEmpty. Operand 22496 states. [2019-12-28 03:40:26,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-28 03:40:26,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:40:26,352 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:26,353 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:26,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:40:26,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1922426572, now seen corresponding path program 1 times [2019-12-28 03:40:26,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:40:26,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948834729] [2019-12-28 03:40:26,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:40:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:40:26,712 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:26,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948834729] [2019-12-28 03:40:26,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:40:26,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:40:26,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1030596713] [2019-12-28 03:40:26,717 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:40:26,725 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:40:26,756 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 39 transitions. [2019-12-28 03:40:26,757 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:40:26,765 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:40:26,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:40:26,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:40:26,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:40:26,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:40:26,783 INFO L87 Difference]: Start difference. First operand 22496 states. Second operand 4 states. [2019-12-28 03:40:27,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:40:27,370 INFO L93 Difference]: Finished difference Result 23448 states and 91749 transitions. [2019-12-28 03:40:27,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:40:27,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-28 03:40:27,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:40:27,603 INFO L225 Difference]: With dead ends: 23448 [2019-12-28 03:40:27,603 INFO L226 Difference]: Without dead ends: 21272 [2019-12-28 03:40:27,606 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:28,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21272 states. [2019-12-28 03:40:29,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21272 to 21272. [2019-12-28 03:40:29,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21272 states. [2019-12-28 03:40:29,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21272 states to 21272 states and 83773 transitions. [2019-12-28 03:40:29,660 INFO L78 Accepts]: Start accepts. Automaton has 21272 states and 83773 transitions. Word has length 39 [2019-12-28 03:40:29,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:40:29,661 INFO L462 AbstractCegarLoop]: Abstraction has 21272 states and 83773 transitions. [2019-12-28 03:40:29,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:40:29,662 INFO L276 IsEmpty]: Start isEmpty. Operand 21272 states and 83773 transitions. [2019-12-28 03:40:29,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-28 03:40:29,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:40:29,675 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:29,676 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:29,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:40:29,676 INFO L82 PathProgramCache]: Analyzing trace with hash -184333443, now seen corresponding path program 1 times [2019-12-28 03:40:29,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:40:29,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507848043] [2019-12-28 03:40:29,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:40:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:40:29,814 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:29,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507848043] [2019-12-28 03:40:29,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:40:29,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:40:29,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [930987763] [2019-12-28 03:40:29,815 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:40:29,820 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:40:29,835 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 75 states and 102 transitions. [2019-12-28 03:40:29,836 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:40:29,917 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:40:29,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:40:29,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:40:29,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:40:29,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:40:29,921 INFO L87 Difference]: Start difference. First operand 21272 states and 83773 transitions. Second operand 6 states. [2019-12-28 03:40:31,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:40:31,923 INFO L93 Difference]: Finished difference Result 34706 states and 129065 transitions. [2019-12-28 03:40:31,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:40:31,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-12-28 03:40:31,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:40:32,079 INFO L225 Difference]: With dead ends: 34706 [2019-12-28 03:40:32,079 INFO L226 Difference]: Without dead ends: 34562 [2019-12-28 03:40:32,080 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:32,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34562 states. [2019-12-28 03:40:33,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34562 to 33062. [2019-12-28 03:40:33,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33062 states. [2019-12-28 03:40:33,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33062 states to 33062 states and 123953 transitions. [2019-12-28 03:40:33,303 INFO L78 Accepts]: Start accepts. Automaton has 33062 states and 123953 transitions. Word has length 46 [2019-12-28 03:40:33,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:40:33,304 INFO L462 AbstractCegarLoop]: Abstraction has 33062 states and 123953 transitions. [2019-12-28 03:40:33,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:40:33,304 INFO L276 IsEmpty]: Start isEmpty. Operand 33062 states and 123953 transitions. [2019-12-28 03:40:33,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-28 03:40:33,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:40:33,309 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:33,309 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:33,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:40:33,310 INFO L82 PathProgramCache]: Analyzing trace with hash -2043575512, now seen corresponding path program 1 times [2019-12-28 03:40:33,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:40:33,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510419816] [2019-12-28 03:40:33,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:40:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:40:33,617 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:33,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510419816] [2019-12-28 03:40:33,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:40:33,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:40:33,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1913153781] [2019-12-28 03:40:33,618 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:40:33,622 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:40:33,626 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 47 transitions. [2019-12-28 03:40:33,626 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:40:33,627 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:40:33,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:40:33,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:40:33,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:40:33,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:40:33,628 INFO L87 Difference]: Start difference. First operand 33062 states and 123953 transitions. Second operand 5 states. [2019-12-28 03:40:34,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:40:34,187 INFO L93 Difference]: Finished difference Result 40214 states and 148622 transitions. [2019-12-28 03:40:34,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:40:34,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-28 03:40:34,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:40:34,375 INFO L225 Difference]: With dead ends: 40214 [2019-12-28 03:40:34,376 INFO L226 Difference]: Without dead ends: 40054 [2019-12-28 03:40:34,376 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:34,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40054 states. [2019-12-28 03:40:36,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40054 to 34635. [2019-12-28 03:40:36,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34635 states. [2019-12-28 03:40:36,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34635 states to 34635 states and 129249 transitions. [2019-12-28 03:40:36,825 INFO L78 Accepts]: Start accepts. Automaton has 34635 states and 129249 transitions. Word has length 47 [2019-12-28 03:40:36,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:40:36,825 INFO L462 AbstractCegarLoop]: Abstraction has 34635 states and 129249 transitions. [2019-12-28 03:40:36,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:40:36,826 INFO L276 IsEmpty]: Start isEmpty. Operand 34635 states and 129249 transitions. [2019-12-28 03:40:36,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 03:40:36,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:40:36,848 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:36,849 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:36,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:40:36,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1974753575, now seen corresponding path program 1 times [2019-12-28 03:40:36,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:40:36,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153380414] [2019-12-28 03:40:36,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:40:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:40:36,947 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:36,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153380414] [2019-12-28 03:40:36,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:40:36,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:40:36,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1818058285] [2019-12-28 03:40:36,949 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:40:36,956 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:40:37,205 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 97 states and 138 transitions. [2019-12-28 03:40:37,205 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:40:37,238 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:40:37,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:40:37,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:40:37,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:40:37,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:40:37,239 INFO L87 Difference]: Start difference. First operand 34635 states and 129249 transitions. Second operand 7 states. [2019-12-28 03:40:38,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:40:38,278 INFO L93 Difference]: Finished difference Result 45663 states and 166143 transitions. [2019-12-28 03:40:38,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 03:40:38,278 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-28 03:40:38,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:40:38,586 INFO L225 Difference]: With dead ends: 45663 [2019-12-28 03:40:38,587 INFO L226 Difference]: Without dead ends: 45519 [2019-12-28 03:40:38,587 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:40:38,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45519 states. [2019-12-28 03:40:40,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45519 to 33598. [2019-12-28 03:40:40,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33598 states. [2019-12-28 03:40:40,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33598 states to 33598 states and 125404 transitions. [2019-12-28 03:40:40,988 INFO L78 Accepts]: Start accepts. Automaton has 33598 states and 125404 transitions. Word has length 54 [2019-12-28 03:40:40,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:40:40,988 INFO L462 AbstractCegarLoop]: Abstraction has 33598 states and 125404 transitions. [2019-12-28 03:40:40,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:40:40,988 INFO L276 IsEmpty]: Start isEmpty. Operand 33598 states and 125404 transitions. [2019-12-28 03:40:41,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-28 03:40:41,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:40:41,018 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:40:41,018 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:40:41,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:40:41,019 INFO L82 PathProgramCache]: Analyzing trace with hash 194121141, now seen corresponding path program 1 times [2019-12-28 03:40:41,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:40:41,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445243986] [2019-12-28 03:40:41,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:40:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:40:41,130 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:41,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445243986] [2019-12-28 03:40:41,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:40:41,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:40:41,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1396704831] [2019-12-28 03:40:41,131 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:40:41,141 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:40:41,150 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 61 transitions. [2019-12-28 03:40:41,150 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:40:41,150 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:40:41,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:40:41,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:40:41,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:40:41,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:40:41,151 INFO L87 Difference]: Start difference. First operand 33598 states and 125404 transitions. Second operand 6 states. [2019-12-28 03:40:42,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:40:42,120 INFO L93 Difference]: Finished difference Result 46070 states and 167837 transitions. [2019-12-28 03:40:42,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 03:40:42,120 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-28 03:40:42,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:40:42,259 INFO L225 Difference]: With dead ends: 46070 [2019-12-28 03:40:42,259 INFO L226 Difference]: Without dead ends: 45830 [2019-12-28 03:40:42,260 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:40:42,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45830 states. [2019-12-28 03:40:44,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45830 to 39959. [2019-12-28 03:40:44,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39959 states. [2019-12-28 03:40:44,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39959 states to 39959 states and 147328 transitions. [2019-12-28 03:40:44,962 INFO L78 Accepts]: Start accepts. Automaton has 39959 states and 147328 transitions. Word has length 61 [2019-12-28 03:40:44,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:40:44,962 INFO L462 AbstractCegarLoop]: Abstraction has 39959 states and 147328 transitions. [2019-12-28 03:40:44,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:40:44,963 INFO L276 IsEmpty]: Start isEmpty. Operand 39959 states and 147328 transitions. [2019-12-28 03:40:44,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-28 03:40:44,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:40:44,994 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:40:44,994 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:40:44,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:40:44,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1160701436, now seen corresponding path program 1 times [2019-12-28 03:40:44,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:40:44,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411471312] [2019-12-28 03:40:44,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:40:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:40:45,042 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:45,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411471312] [2019-12-28 03:40:45,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:40:45,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:40:45,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1192038384] [2019-12-28 03:40:45,044 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:40:45,055 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:40:45,069 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 63 transitions. [2019-12-28 03:40:45,069 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:40:45,070 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:40:45,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:40:45,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:40:45,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:40:45,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:40:45,071 INFO L87 Difference]: Start difference. First operand 39959 states and 147328 transitions. Second operand 3 states. [2019-12-28 03:40:45,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:40:45,354 INFO L93 Difference]: Finished difference Result 50257 states and 182163 transitions. [2019-12-28 03:40:45,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:40:45,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-28 03:40:45,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:40:45,457 INFO L225 Difference]: With dead ends: 50257 [2019-12-28 03:40:45,457 INFO L226 Difference]: Without dead ends: 50257 [2019-12-28 03:40:45,458 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:40:45,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50257 states. [2019-12-28 03:40:46,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50257 to 43889. [2019-12-28 03:40:46,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43889 states. [2019-12-28 03:40:46,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43889 states to 43889 states and 160766 transitions. [2019-12-28 03:40:46,550 INFO L78 Accepts]: Start accepts. Automaton has 43889 states and 160766 transitions. Word has length 63 [2019-12-28 03:40:46,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:40:46,550 INFO L462 AbstractCegarLoop]: Abstraction has 43889 states and 160766 transitions. [2019-12-28 03:40:46,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:40:46,551 INFO L276 IsEmpty]: Start isEmpty. Operand 43889 states and 160766 transitions. [2019-12-28 03:40:46,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 03:40:46,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:40:46,584 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:40:46,584 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:40:46,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:40:46,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1771534722, now seen corresponding path program 1 times [2019-12-28 03:40:46,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:40:46,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365046230] [2019-12-28 03:40:46,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:40:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:40:46,711 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:46,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365046230] [2019-12-28 03:40:46,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:40:46,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:40:46,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [682349523] [2019-12-28 03:40:46,714 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:40:46,725 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:40:46,740 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 67 transitions. [2019-12-28 03:40:46,740 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:40:46,741 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:40:46,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:40:46,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:40:46,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:40:46,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:40:46,743 INFO L87 Difference]: Start difference. First operand 43889 states and 160766 transitions. Second operand 7 states. [2019-12-28 03:40:47,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:40:47,808 INFO L93 Difference]: Finished difference Result 55885 states and 200500 transitions. [2019-12-28 03:40:47,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-28 03:40:47,809 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-28 03:40:47,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:40:48,409 INFO L225 Difference]: With dead ends: 55885 [2019-12-28 03:40:48,409 INFO L226 Difference]: Without dead ends: 55645 [2019-12-28 03:40:48,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-12-28 03:40:48,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55645 states. [2019-12-28 03:40:49,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55645 to 45115. [2019-12-28 03:40:49,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45115 states. [2019-12-28 03:40:49,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45115 states to 45115 states and 164933 transitions. [2019-12-28 03:40:49,281 INFO L78 Accepts]: Start accepts. Automaton has 45115 states and 164933 transitions. Word has length 67 [2019-12-28 03:40:49,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:40:49,282 INFO L462 AbstractCegarLoop]: Abstraction has 45115 states and 164933 transitions. [2019-12-28 03:40:49,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:40:49,282 INFO L276 IsEmpty]: Start isEmpty. Operand 45115 states and 164933 transitions. [2019-12-28 03:40:49,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 03:40:49,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:40:49,314 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:40:49,315 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:40:49,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:40:49,315 INFO L82 PathProgramCache]: Analyzing trace with hash -93886554, now seen corresponding path program 1 times [2019-12-28 03:40:49,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:40:49,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162253268] [2019-12-28 03:40:49,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:40:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:40:50,709 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,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162253268] [2019-12-28 03:40:50,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:40:50,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:40:50,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1606821320] [2019-12-28 03:40:50,710 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:40:50,725 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:40:50,752 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 152 transitions. [2019-12-28 03:40:50,752 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:40:50,778 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:40:50,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:40:50,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:40:50,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:40:50,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:40:50,779 INFO L87 Difference]: Start difference. First operand 45115 states and 164933 transitions. Second operand 8 states. [2019-12-28 03:40:52,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:40:52,083 INFO L93 Difference]: Finished difference Result 55099 states and 197677 transitions. [2019-12-28 03:40:52,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-28 03:40:52,084 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-12-28 03:40:52,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:40:52,207 INFO L225 Difference]: With dead ends: 55099 [2019-12-28 03:40:52,207 INFO L226 Difference]: Without dead ends: 54899 [2019-12-28 03:40:52,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2019-12-28 03:40:52,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54899 states. [2019-12-28 03:40:53,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54899 to 45993. [2019-12-28 03:40:53,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45993 states. [2019-12-28 03:40:53,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45993 states to 45993 states and 167804 transitions. [2019-12-28 03:40:53,290 INFO L78 Accepts]: Start accepts. Automaton has 45993 states and 167804 transitions. Word has length 68 [2019-12-28 03:40:53,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:40:53,291 INFO L462 AbstractCegarLoop]: Abstraction has 45993 states and 167804 transitions. [2019-12-28 03:40:53,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:40:53,291 INFO L276 IsEmpty]: Start isEmpty. Operand 45993 states and 167804 transitions. [2019-12-28 03:40:53,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-28 03:40:53,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:40:53,322 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:40:53,323 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:40:53,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:40:53,323 INFO L82 PathProgramCache]: Analyzing trace with hash 796822408, now seen corresponding path program 1 times [2019-12-28 03:40:53,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:40:53,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63054130] [2019-12-28 03:40:53,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:40:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:40:53,449 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:53,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63054130] [2019-12-28 03:40:53,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:40:53,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:40:53,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1263051519] [2019-12-28 03:40:53,450 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:40:53,457 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:40:53,467 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 74 transitions. [2019-12-28 03:40:53,467 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:40:53,467 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:40:53,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:40:53,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:40:53,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:40:53,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:40:53,468 INFO L87 Difference]: Start difference. First operand 45993 states and 167804 transitions. Second operand 6 states. [2019-12-28 03:40:54,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:40:54,285 INFO L93 Difference]: Finished difference Result 65553 states and 237331 transitions. [2019-12-28 03:40:54,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:40:54,285 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-12-28 03:40:54,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:40:54,422 INFO L225 Difference]: With dead ends: 65553 [2019-12-28 03:40:54,422 INFO L226 Difference]: Without dead ends: 64909 [2019-12-28 03:40:54,423 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:40:55,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64909 states. [2019-12-28 03:40:55,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64909 to 56043. [2019-12-28 03:40:55,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56043 states. [2019-12-28 03:40:55,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56043 states to 56043 states and 204334 transitions. [2019-12-28 03:40:55,925 INFO L78 Accepts]: Start accepts. Automaton has 56043 states and 204334 transitions. Word has length 70 [2019-12-28 03:40:55,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:40:55,925 INFO L462 AbstractCegarLoop]: Abstraction has 56043 states and 204334 transitions. [2019-12-28 03:40:55,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:40:55,925 INFO L276 IsEmpty]: Start isEmpty. Operand 56043 states and 204334 transitions. [2019-12-28 03:40:55,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-28 03:40:55,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:40:55,976 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:40:55,976 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:40:55,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:40:55,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1758436425, now seen corresponding path program 1 times [2019-12-28 03:40:55,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:40:55,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401770241] [2019-12-28 03:40:55,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:40:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:40:56,079 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:56,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401770241] [2019-12-28 03:40:56,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:40:56,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:40:56,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [712504964] [2019-12-28 03:40:56,081 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:40:56,091 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:40:56,105 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 74 transitions. [2019-12-28 03:40:56,105 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:40:56,106 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:40:56,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:40:56,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:40:56,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:40:56,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:40:56,107 INFO L87 Difference]: Start difference. First operand 56043 states and 204334 transitions. Second operand 7 states. [2019-12-28 03:40:57,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:40:57,638 INFO L93 Difference]: Finished difference Result 83031 states and 292762 transitions. [2019-12-28 03:40:57,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 03:40:57,639 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-12-28 03:40:57,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:40:57,821 INFO L225 Difference]: With dead ends: 83031 [2019-12-28 03:40:57,821 INFO L226 Difference]: Without dead ends: 83031 [2019-12-28 03:40:57,821 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:40:58,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83031 states. [2019-12-28 03:41:01,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83031 to 76080. [2019-12-28 03:41:01,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76080 states. [2019-12-28 03:41:01,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76080 states to 76080 states and 270629 transitions. [2019-12-28 03:41:01,770 INFO L78 Accepts]: Start accepts. Automaton has 76080 states and 270629 transitions. Word has length 70 [2019-12-28 03:41:01,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:01,771 INFO L462 AbstractCegarLoop]: Abstraction has 76080 states and 270629 transitions. [2019-12-28 03:41:01,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:41:01,771 INFO L276 IsEmpty]: Start isEmpty. Operand 76080 states and 270629 transitions. [2019-12-28 03:41:01,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-28 03:41:01,850 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:01,850 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:01,851 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:01,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:01,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1291766390, now seen corresponding path program 1 times [2019-12-28 03:41:01,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:01,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049675367] [2019-12-28 03:41:01,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:01,908 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:01,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049675367] [2019-12-28 03:41:01,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:01,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:41:01,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [801455110] [2019-12-28 03:41:01,910 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:01,920 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:01,934 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 74 transitions. [2019-12-28 03:41:01,934 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:01,934 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:41:01,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:41:01,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:01,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:41:01,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:41:01,936 INFO L87 Difference]: Start difference. First operand 76080 states and 270629 transitions. Second operand 3 states. [2019-12-28 03:41:02,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:02,263 INFO L93 Difference]: Finished difference Result 54416 states and 197410 transitions. [2019-12-28 03:41:02,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:41:02,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-28 03:41:02,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:02,379 INFO L225 Difference]: With dead ends: 54416 [2019-12-28 03:41:02,379 INFO L226 Difference]: Without dead ends: 54254 [2019-12-28 03:41:02,380 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:02,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54254 states. [2019-12-28 03:41:03,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54254 to 54214. [2019-12-28 03:41:03,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54214 states. [2019-12-28 03:41:03,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54214 states to 54214 states and 196825 transitions. [2019-12-28 03:41:03,923 INFO L78 Accepts]: Start accepts. Automaton has 54214 states and 196825 transitions. Word has length 70 [2019-12-28 03:41:03,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:03,923 INFO L462 AbstractCegarLoop]: Abstraction has 54214 states and 196825 transitions. [2019-12-28 03:41:03,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:41:03,923 INFO L276 IsEmpty]: Start isEmpty. Operand 54214 states and 196825 transitions. [2019-12-28 03:41:03,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 03:41:03,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:03,962 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:03,962 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:03,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:03,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1538482368, now seen corresponding path program 1 times [2019-12-28 03:41:03,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:03,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199701212] [2019-12-28 03:41:03,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:04,081 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,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199701212] [2019-12-28 03:41:04,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:04,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:41:04,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [686136736] [2019-12-28 03:41:04,083 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:04,091 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:04,104 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 71 transitions. [2019-12-28 03:41:04,104 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:04,105 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:41:04,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:41:04,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:04,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:41:04,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:41:04,106 INFO L87 Difference]: Start difference. First operand 54214 states and 196825 transitions. Second operand 5 states. [2019-12-28 03:41:04,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:04,899 INFO L93 Difference]: Finished difference Result 84429 states and 303657 transitions. [2019-12-28 03:41:04,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 03:41:04,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-28 03:41:04,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:05,097 INFO L225 Difference]: With dead ends: 84429 [2019-12-28 03:41:05,097 INFO L226 Difference]: Without dead ends: 84233 [2019-12-28 03:41:05,097 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:05,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84233 states. [2019-12-28 03:41:07,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84233 to 76148. [2019-12-28 03:41:07,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76148 states. [2019-12-28 03:41:07,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76148 states to 76148 states and 275545 transitions. [2019-12-28 03:41:07,228 INFO L78 Accepts]: Start accepts. Automaton has 76148 states and 275545 transitions. Word has length 71 [2019-12-28 03:41:07,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:07,228 INFO L462 AbstractCegarLoop]: Abstraction has 76148 states and 275545 transitions. [2019-12-28 03:41:07,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:41:07,228 INFO L276 IsEmpty]: Start isEmpty. Operand 76148 states and 275545 transitions. [2019-12-28 03:41:07,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 03:41:07,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:07,286 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:07,287 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:07,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:07,287 INFO L82 PathProgramCache]: Analyzing trace with hash -293717887, now seen corresponding path program 1 times [2019-12-28 03:41:07,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:07,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240741124] [2019-12-28 03:41:07,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:07,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:07,403 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,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240741124] [2019-12-28 03:41:07,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:07,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:41:07,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1122749254] [2019-12-28 03:41:07,405 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:07,415 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:07,427 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 71 transitions. [2019-12-28 03:41:07,428 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:07,428 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:41:07,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:41:07,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:07,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:41:07,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:41:07,429 INFO L87 Difference]: Start difference. First operand 76148 states and 275545 transitions. Second operand 5 states. [2019-12-28 03:41:07,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:07,576 INFO L93 Difference]: Finished difference Result 19616 states and 62266 transitions. [2019-12-28 03:41:07,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 03:41:07,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-28 03:41:07,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:07,618 INFO L225 Difference]: With dead ends: 19616 [2019-12-28 03:41:07,619 INFO L226 Difference]: Without dead ends: 19138 [2019-12-28 03:41:07,619 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:07,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19138 states. [2019-12-28 03:41:07,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19138 to 19126. [2019-12-28 03:41:07,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19126 states. [2019-12-28 03:41:08,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19126 states to 19126 states and 60761 transitions. [2019-12-28 03:41:08,412 INFO L78 Accepts]: Start accepts. Automaton has 19126 states and 60761 transitions. Word has length 71 [2019-12-28 03:41:08,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:08,413 INFO L462 AbstractCegarLoop]: Abstraction has 19126 states and 60761 transitions. [2019-12-28 03:41:08,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:41:08,413 INFO L276 IsEmpty]: Start isEmpty. Operand 19126 states and 60761 transitions. [2019-12-28 03:41:08,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-28 03:41:08,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:08,429 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:08,429 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:08,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:08,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1162099754, now seen corresponding path program 1 times [2019-12-28 03:41:08,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:08,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400499395] [2019-12-28 03:41:08,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:08,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:41:08,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400499395] [2019-12-28 03:41:08,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:08,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:41:08,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [316900986] [2019-12-28 03:41:08,482 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:08,520 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:08,571 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 184 transitions. [2019-12-28 03:41:08,571 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:08,605 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 03:41:08,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:41:08,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:08,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:41:08,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:41:08,607 INFO L87 Difference]: Start difference. First operand 19126 states and 60761 transitions. Second operand 6 states. [2019-12-28 03:41:08,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:08,966 INFO L93 Difference]: Finished difference Result 24076 states and 75429 transitions. [2019-12-28 03:41:08,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:41:08,966 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-12-28 03:41:08,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:09,002 INFO L225 Difference]: With dead ends: 24076 [2019-12-28 03:41:09,002 INFO L226 Difference]: Without dead ends: 24076 [2019-12-28 03:41:09,002 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:09,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24076 states. [2019-12-28 03:41:09,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24076 to 19966. [2019-12-28 03:41:09,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19966 states. [2019-12-28 03:41:09,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19966 states to 19966 states and 63128 transitions. [2019-12-28 03:41:09,280 INFO L78 Accepts]: Start accepts. Automaton has 19966 states and 63128 transitions. Word has length 80 [2019-12-28 03:41:09,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:09,280 INFO L462 AbstractCegarLoop]: Abstraction has 19966 states and 63128 transitions. [2019-12-28 03:41:09,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:41:09,280 INFO L276 IsEmpty]: Start isEmpty. Operand 19966 states and 63128 transitions. [2019-12-28 03:41:09,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-28 03:41:09,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:09,296 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:09,296 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:09,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:09,296 INFO L82 PathProgramCache]: Analyzing trace with hash 907363209, now seen corresponding path program 1 times [2019-12-28 03:41:09,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:09,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441104264] [2019-12-28 03:41:09,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:09,403 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:09,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441104264] [2019-12-28 03:41:09,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:09,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 03:41:09,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [597692530] [2019-12-28 03:41:09,404 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:09,421 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:09,466 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 184 transitions. [2019-12-28 03:41:09,466 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:09,497 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:41:09,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 03:41:09,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:09,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 03:41:09,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:41:09,498 INFO L87 Difference]: Start difference. First operand 19966 states and 63128 transitions. Second operand 9 states. [2019-12-28 03:41:10,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:10,476 INFO L93 Difference]: Finished difference Result 22072 states and 69320 transitions. [2019-12-28 03:41:10,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-28 03:41:10,477 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-12-28 03:41:10,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:10,512 INFO L225 Difference]: With dead ends: 22072 [2019-12-28 03:41:10,512 INFO L226 Difference]: Without dead ends: 22024 [2019-12-28 03:41:10,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2019-12-28 03:41:10,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22024 states. [2019-12-28 03:41:10,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22024 to 19438. [2019-12-28 03:41:10,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19438 states. [2019-12-28 03:41:10,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19438 states to 19438 states and 61630 transitions. [2019-12-28 03:41:10,779 INFO L78 Accepts]: Start accepts. Automaton has 19438 states and 61630 transitions. Word has length 80 [2019-12-28 03:41:10,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:10,779 INFO L462 AbstractCegarLoop]: Abstraction has 19438 states and 61630 transitions. [2019-12-28 03:41:10,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 03:41:10,779 INFO L276 IsEmpty]: Start isEmpty. Operand 19438 states and 61630 transitions. [2019-12-28 03:41:10,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 03:41:10,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:10,795 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:10,795 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:10,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:10,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1999994915, now seen corresponding path program 1 times [2019-12-28 03:41:10,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:10,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263153742] [2019-12-28 03:41:10,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:10,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:41:10,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263153742] [2019-12-28 03:41:10,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:10,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 03:41:10,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1250073690] [2019-12-28 03:41:10,887 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:10,903 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:10,927 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 93 transitions. [2019-12-28 03:41:10,927 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:10,928 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:41:10,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:41:10,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:10,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:41:10,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:41:10,929 INFO L87 Difference]: Start difference. First operand 19438 states and 61630 transitions. Second operand 8 states. [2019-12-28 03:41:14,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:14,029 INFO L93 Difference]: Finished difference Result 50432 states and 153648 transitions. [2019-12-28 03:41:14,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-28 03:41:14,030 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2019-12-28 03:41:14,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:14,172 INFO L225 Difference]: With dead ends: 50432 [2019-12-28 03:41:14,172 INFO L226 Difference]: Without dead ends: 49733 [2019-12-28 03:41:14,173 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:14,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49733 states. [2019-12-28 03:41:15,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49733 to 29966. [2019-12-28 03:41:15,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29966 states. [2019-12-28 03:41:15,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29966 states to 29966 states and 93560 transitions. [2019-12-28 03:41:15,170 INFO L78 Accepts]: Start accepts. Automaton has 29966 states and 93560 transitions. Word has length 83 [2019-12-28 03:41:15,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:15,170 INFO L462 AbstractCegarLoop]: Abstraction has 29966 states and 93560 transitions. [2019-12-28 03:41:15,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:41:15,170 INFO L276 IsEmpty]: Start isEmpty. Operand 29966 states and 93560 transitions. [2019-12-28 03:41:15,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 03:41:15,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:15,218 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:15,218 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:15,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:15,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1038380898, now seen corresponding path program 1 times [2019-12-28 03:41:15,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:15,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950923583] [2019-12-28 03:41:15,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:15,369 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,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950923583] [2019-12-28 03:41:15,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:15,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:41:15,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [265512251] [2019-12-28 03:41:15,372 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:15,404 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:15,436 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 93 transitions. [2019-12-28 03:41:15,436 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:15,440 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 03:41:15,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:41:15,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:15,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:41:15,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:41:15,441 INFO L87 Difference]: Start difference. First operand 29966 states and 93560 transitions. Second operand 6 states. [2019-12-28 03:41:16,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:16,255 INFO L93 Difference]: Finished difference Result 31404 states and 97497 transitions. [2019-12-28 03:41:16,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:41:16,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-12-28 03:41:16,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:16,344 INFO L225 Difference]: With dead ends: 31404 [2019-12-28 03:41:16,344 INFO L226 Difference]: Without dead ends: 31404 [2019-12-28 03:41:16,345 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:16,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31404 states. [2019-12-28 03:41:16,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31404 to 29635. [2019-12-28 03:41:16,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29635 states. [2019-12-28 03:41:17,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29635 states to 29635 states and 92403 transitions. [2019-12-28 03:41:17,169 INFO L78 Accepts]: Start accepts. Automaton has 29635 states and 92403 transitions. Word has length 83 [2019-12-28 03:41:17,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:17,169 INFO L462 AbstractCegarLoop]: Abstraction has 29635 states and 92403 transitions. [2019-12-28 03:41:17,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:41:17,169 INFO L276 IsEmpty]: Start isEmpty. Operand 29635 states and 92403 transitions. [2019-12-28 03:41:17,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 03:41:17,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:17,196 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:17,196 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:17,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:17,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1320926111, now seen corresponding path program 1 times [2019-12-28 03:41:17,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:17,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257768176] [2019-12-28 03:41:17,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:17,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:41:17,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257768176] [2019-12-28 03:41:17,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:17,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:41:17,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1639964622] [2019-12-28 03:41:17,299 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:17,314 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:17,340 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 93 transitions. [2019-12-28 03:41:17,340 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:17,343 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 03:41:17,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:41:17,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:17,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:41:17,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:41:17,350 INFO L87 Difference]: Start difference. First operand 29635 states and 92403 transitions. Second operand 7 states. [2019-12-28 03:41:17,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:17,951 INFO L93 Difference]: Finished difference Result 31149 states and 96559 transitions. [2019-12-28 03:41:17,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 03:41:17,952 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-12-28 03:41:17,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:18,001 INFO L225 Difference]: With dead ends: 31149 [2019-12-28 03:41:18,001 INFO L226 Difference]: Without dead ends: 31149 [2019-12-28 03:41:18,001 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:18,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31149 states. [2019-12-28 03:41:18,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31149 to 29967. [2019-12-28 03:41:18,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29967 states. [2019-12-28 03:41:18,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29967 states to 29967 states and 93234 transitions. [2019-12-28 03:41:18,428 INFO L78 Accepts]: Start accepts. Automaton has 29967 states and 93234 transitions. Word has length 83 [2019-12-28 03:41:18,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:18,428 INFO L462 AbstractCegarLoop]: Abstraction has 29967 states and 93234 transitions. [2019-12-28 03:41:18,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:41:18,428 INFO L276 IsEmpty]: Start isEmpty. Operand 29967 states and 93234 transitions. [2019-12-28 03:41:18,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 03:41:18,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:18,458 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,458 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:18,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:18,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1650691872, now seen corresponding path program 1 times [2019-12-28 03:41:18,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:18,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806117989] [2019-12-28 03:41:18,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:18,529 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:18,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806117989] [2019-12-28 03:41:18,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:18,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:41:18,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [64340785] [2019-12-28 03:41:18,531 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:18,546 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:18,571 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 93 transitions. [2019-12-28 03:41:18,571 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:18,571 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:41:18,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:41:18,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:18,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:41:18,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:41:18,572 INFO L87 Difference]: Start difference. First operand 29967 states and 93234 transitions. Second operand 5 states. [2019-12-28 03:41:18,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:18,628 INFO L93 Difference]: Finished difference Result 4530 states and 11170 transitions. [2019-12-28 03:41:18,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 03:41:18,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-12-28 03:41:18,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:18,636 INFO L225 Difference]: With dead ends: 4530 [2019-12-28 03:41:18,636 INFO L226 Difference]: Without dead ends: 3740 [2019-12-28 03:41:18,637 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:18,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3740 states. [2019-12-28 03:41:18,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3740 to 3437. [2019-12-28 03:41:18,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3437 states. [2019-12-28 03:41:18,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3437 states to 3437 states and 8371 transitions. [2019-12-28 03:41:18,712 INFO L78 Accepts]: Start accepts. Automaton has 3437 states and 8371 transitions. Word has length 83 [2019-12-28 03:41:18,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:18,712 INFO L462 AbstractCegarLoop]: Abstraction has 3437 states and 8371 transitions. [2019-12-28 03:41:18,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:41:18,713 INFO L276 IsEmpty]: Start isEmpty. Operand 3437 states and 8371 transitions. [2019-12-28 03:41:18,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 03:41:18,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:18,719 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:41:18,719 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:18,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:18,720 INFO L82 PathProgramCache]: Analyzing trace with hash -843880616, now seen corresponding path program 1 times [2019-12-28 03:41:18,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:18,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989561167] [2019-12-28 03:41:18,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:18,832 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:18,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989561167] [2019-12-28 03:41:18,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:18,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:41:18,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1858562680] [2019-12-28 03:41:18,833 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:18,876 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:18,956 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 128 states and 159 transitions. [2019-12-28 03:41:18,956 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:18,999 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 03:41:18,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:41:18,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:19,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:41:19,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:41:19,000 INFO L87 Difference]: Start difference. First operand 3437 states and 8371 transitions. Second operand 8 states. [2019-12-28 03:41:20,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:20,344 INFO L93 Difference]: Finished difference Result 7412 states and 17652 transitions. [2019-12-28 03:41:20,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-28 03:41:20,345 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-12-28 03:41:20,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:20,354 INFO L225 Difference]: With dead ends: 7412 [2019-12-28 03:41:20,354 INFO L226 Difference]: Without dead ends: 7338 [2019-12-28 03:41:20,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-12-28 03:41:20,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7338 states. [2019-12-28 03:41:20,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7338 to 3789. [2019-12-28 03:41:20,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3789 states. [2019-12-28 03:41:20,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3789 states to 3789 states and 9126 transitions. [2019-12-28 03:41:20,402 INFO L78 Accepts]: Start accepts. Automaton has 3789 states and 9126 transitions. Word has length 95 [2019-12-28 03:41:20,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:20,402 INFO L462 AbstractCegarLoop]: Abstraction has 3789 states and 9126 transitions. [2019-12-28 03:41:20,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:41:20,402 INFO L276 IsEmpty]: Start isEmpty. Operand 3789 states and 9126 transitions. [2019-12-28 03:41:20,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 03:41:20,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:20,405 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:20,405 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:20,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:20,406 INFO L82 PathProgramCache]: Analyzing trace with hash 285188987, now seen corresponding path program 1 times [2019-12-28 03:41:20,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:20,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055851476] [2019-12-28 03:41:20,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:20,476 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,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055851476] [2019-12-28 03:41:20,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:20,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:41:20,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1253242173] [2019-12-28 03:41:20,477 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:20,505 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:20,563 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 169 transitions. [2019-12-28 03:41:20,563 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:20,640 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-28 03:41:20,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:41:20,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:20,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:41:20,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:41:20,641 INFO L87 Difference]: Start difference. First operand 3789 states and 9126 transitions. Second operand 8 states. [2019-12-28 03:41:21,522 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-12-28 03:41:21,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:21,845 INFO L93 Difference]: Finished difference Result 6447 states and 15473 transitions. [2019-12-28 03:41:21,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-28 03:41:21,846 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-12-28 03:41:21,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:21,854 INFO L225 Difference]: With dead ends: 6447 [2019-12-28 03:41:21,854 INFO L226 Difference]: Without dead ends: 6390 [2019-12-28 03:41:21,854 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:21,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6390 states. [2019-12-28 03:41:21,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6390 to 4043. [2019-12-28 03:41:21,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4043 states. [2019-12-28 03:41:21,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4043 states to 4043 states and 9666 transitions. [2019-12-28 03:41:21,902 INFO L78 Accepts]: Start accepts. Automaton has 4043 states and 9666 transitions. Word has length 95 [2019-12-28 03:41:21,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:21,902 INFO L462 AbstractCegarLoop]: Abstraction has 4043 states and 9666 transitions. [2019-12-28 03:41:21,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:41:21,903 INFO L276 IsEmpty]: Start isEmpty. Operand 4043 states and 9666 transitions. [2019-12-28 03:41:21,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 03:41:21,906 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:21,906 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:21,907 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:21,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:21,907 INFO L82 PathProgramCache]: Analyzing trace with hash -637494596, now seen corresponding path program 1 times [2019-12-28 03:41:21,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:21,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557548157] [2019-12-28 03:41:21,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:22,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:22,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557548157] [2019-12-28 03:41:22,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:22,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:41:22,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1478809734] [2019-12-28 03:41:22,013 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:22,059 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:22,141 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 169 transitions. [2019-12-28 03:41:22,141 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:22,172 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 03:41:22,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:41:22,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:22,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:41:22,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:41:22,174 INFO L87 Difference]: Start difference. First operand 4043 states and 9666 transitions. Second operand 8 states. [2019-12-28 03:41:23,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:23,356 INFO L93 Difference]: Finished difference Result 8893 states and 20608 transitions. [2019-12-28 03:41:23,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-28 03:41:23,357 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-12-28 03:41:23,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:23,367 INFO L225 Difference]: With dead ends: 8893 [2019-12-28 03:41:23,367 INFO L226 Difference]: Without dead ends: 8773 [2019-12-28 03:41:23,368 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:23,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8773 states. [2019-12-28 03:41:23,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8773 to 4263. [2019-12-28 03:41:23,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4263 states. [2019-12-28 03:41:23,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4263 states to 4263 states and 10155 transitions. [2019-12-28 03:41:23,427 INFO L78 Accepts]: Start accepts. Automaton has 4263 states and 10155 transitions. Word has length 95 [2019-12-28 03:41:23,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:23,427 INFO L462 AbstractCegarLoop]: Abstraction has 4263 states and 10155 transitions. [2019-12-28 03:41:23,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:41:23,427 INFO L276 IsEmpty]: Start isEmpty. Operand 4263 states and 10155 transitions. [2019-12-28 03:41:23,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 03:41:23,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:23,431 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:23,431 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:23,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:23,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1721812413, now seen corresponding path program 1 times [2019-12-28 03:41:23,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:23,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750329545] [2019-12-28 03:41:23,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:23,543 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:23,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750329545] [2019-12-28 03:41:23,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:23,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:41:23,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2016525046] [2019-12-28 03:41:23,544 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:23,567 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:23,631 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 169 transitions. [2019-12-28 03:41:23,631 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:23,663 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 03:41:23,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:41:23,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:23,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:41:23,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:41:23,664 INFO L87 Difference]: Start difference. First operand 4263 states and 10155 transitions. Second operand 8 states. [2019-12-28 03:41:24,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:24,375 INFO L93 Difference]: Finished difference Result 7913 states and 18703 transitions. [2019-12-28 03:41:24,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 03:41:24,376 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-12-28 03:41:24,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:24,390 INFO L225 Difference]: With dead ends: 7913 [2019-12-28 03:41:24,391 INFO L226 Difference]: Without dead ends: 7885 [2019-12-28 03:41:24,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-12-28 03:41:24,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7885 states. [2019-12-28 03:41:24,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7885 to 4347. [2019-12-28 03:41:24,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4347 states. [2019-12-28 03:41:24,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4347 states to 4347 states and 10224 transitions. [2019-12-28 03:41:24,501 INFO L78 Accepts]: Start accepts. Automaton has 4347 states and 10224 transitions. Word has length 95 [2019-12-28 03:41:24,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:24,501 INFO L462 AbstractCegarLoop]: Abstraction has 4347 states and 10224 transitions. [2019-12-28 03:41:24,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:41:24,502 INFO L276 IsEmpty]: Start isEmpty. Operand 4347 states and 10224 transitions. [2019-12-28 03:41:24,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 03:41:24,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:24,507 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:24,507 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:24,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:24,508 INFO L82 PathProgramCache]: Analyzing trace with hash 2051578174, now seen corresponding path program 1 times [2019-12-28 03:41:24,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:24,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278385051] [2019-12-28 03:41:24,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:24,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:41:24,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278385051] [2019-12-28 03:41:24,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:24,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:41:24,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1518507084] [2019-12-28 03:41:24,595 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:24,612 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:24,683 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 169 transitions. [2019-12-28 03:41:24,683 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:24,685 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:41:24,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:41:24,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:24,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:41:24,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:41:24,687 INFO L87 Difference]: Start difference. First operand 4347 states and 10224 transitions. Second operand 6 states. [2019-12-28 03:41:24,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:24,971 INFO L93 Difference]: Finished difference Result 4789 states and 11142 transitions. [2019-12-28 03:41:24,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 03:41:24,972 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-28 03:41:24,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:24,978 INFO L225 Difference]: With dead ends: 4789 [2019-12-28 03:41:24,979 INFO L226 Difference]: Without dead ends: 4789 [2019-12-28 03:41:24,979 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:24,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4789 states. [2019-12-28 03:41:25,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4789 to 4028. [2019-12-28 03:41:25,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4028 states. [2019-12-28 03:41:25,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4028 states to 4028 states and 9471 transitions. [2019-12-28 03:41:25,023 INFO L78 Accepts]: Start accepts. Automaton has 4028 states and 9471 transitions. Word has length 95 [2019-12-28 03:41:25,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:25,023 INFO L462 AbstractCegarLoop]: Abstraction has 4028 states and 9471 transitions. [2019-12-28 03:41:25,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:41:25,023 INFO L276 IsEmpty]: Start isEmpty. Operand 4028 states and 9471 transitions. [2019-12-28 03:41:25,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 03:41:25,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:25,027 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:25,027 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:25,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:25,028 INFO L82 PathProgramCache]: Analyzing trace with hash 41474333, now seen corresponding path program 1 times [2019-12-28 03:41:25,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:25,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843258168] [2019-12-28 03:41:25,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:25,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:25,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:41:25,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843258168] [2019-12-28 03:41:25,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:25,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:41:25,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [38595108] [2019-12-28 03:41:25,091 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:25,106 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:25,170 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 168 transitions. [2019-12-28 03:41:25,171 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:25,172 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:41:25,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:41:25,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:25,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:41:25,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:41:25,173 INFO L87 Difference]: Start difference. First operand 4028 states and 9471 transitions. Second operand 4 states. [2019-12-28 03:41:25,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:25,457 INFO L93 Difference]: Finished difference Result 4334 states and 10167 transitions. [2019-12-28 03:41:25,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:41:25,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-28 03:41:25,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:25,466 INFO L225 Difference]: With dead ends: 4334 [2019-12-28 03:41:25,466 INFO L226 Difference]: Without dead ends: 4298 [2019-12-28 03:41:25,467 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:25,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4298 states. [2019-12-28 03:41:25,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4298 to 4028. [2019-12-28 03:41:25,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4028 states. [2019-12-28 03:41:25,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4028 states to 4028 states and 9453 transitions. [2019-12-28 03:41:25,542 INFO L78 Accepts]: Start accepts. Automaton has 4028 states and 9453 transitions. Word has length 95 [2019-12-28 03:41:25,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:25,543 INFO L462 AbstractCegarLoop]: Abstraction has 4028 states and 9453 transitions. [2019-12-28 03:41:25,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:41:25,543 INFO L276 IsEmpty]: Start isEmpty. Operand 4028 states and 9453 transitions. [2019-12-28 03:41:25,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 03:41:25,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:25,550 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:25,550 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:25,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:25,551 INFO L82 PathProgramCache]: Analyzing trace with hash -241676131, now seen corresponding path program 1 times [2019-12-28 03:41:25,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:25,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150222764] [2019-12-28 03:41:25,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:25,677 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:25,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150222764] [2019-12-28 03:41:25,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:25,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:41:25,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [417991987] [2019-12-28 03:41:25,678 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:25,700 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:25,781 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 168 transitions. [2019-12-28 03:41:25,781 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:25,795 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 03:41:25,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:41:25,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:25,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:41:25,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:41:25,798 INFO L87 Difference]: Start difference. First operand 4028 states and 9453 transitions. Second operand 6 states. [2019-12-28 03:41:26,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:26,026 INFO L93 Difference]: Finished difference Result 3848 states and 8889 transitions. [2019-12-28 03:41:26,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:41:26,027 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-28 03:41:26,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:26,032 INFO L225 Difference]: With dead ends: 3848 [2019-12-28 03:41:26,033 INFO L226 Difference]: Without dead ends: 3830 [2019-12-28 03:41:26,033 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:26,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3830 states. [2019-12-28 03:41:26,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3830 to 2749. [2019-12-28 03:41:26,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2749 states. [2019-12-28 03:41:26,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2749 states to 2749 states and 6406 transitions. [2019-12-28 03:41:26,080 INFO L78 Accepts]: Start accepts. Automaton has 2749 states and 6406 transitions. Word has length 95 [2019-12-28 03:41:26,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:26,080 INFO L462 AbstractCegarLoop]: Abstraction has 2749 states and 6406 transitions. [2019-12-28 03:41:26,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:41:26,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2749 states and 6406 transitions. [2019-12-28 03:41:26,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 03:41:26,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:26,084 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,084 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:26,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:26,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1003088350, now seen corresponding path program 1 times [2019-12-28 03:41:26,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:26,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532400966] [2019-12-28 03:41:26,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:26,132 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,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532400966] [2019-12-28 03:41:26,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:26,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:41:26,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1660024378] [2019-12-28 03:41:26,133 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,234 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 168 transitions. [2019-12-28 03:41:26,234 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:26,236 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:41:26,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:41:26,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:26,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:41:26,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:41:26,237 INFO L87 Difference]: Start difference. First operand 2749 states and 6406 transitions. Second operand 3 states. [2019-12-28 03:41:26,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:26,268 INFO L93 Difference]: Finished difference Result 2453 states and 5692 transitions. [2019-12-28 03:41:26,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:41:26,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-12-28 03:41:26,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:26,273 INFO L225 Difference]: With dead ends: 2453 [2019-12-28 03:41:26,273 INFO L226 Difference]: Without dead ends: 2435 [2019-12-28 03:41:26,273 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:26,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2019-12-28 03:41:26,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 2265. [2019-12-28 03:41:26,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2265 states. [2019-12-28 03:41:26,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 2265 states and 5296 transitions. [2019-12-28 03:41:26,314 INFO L78 Accepts]: Start accepts. Automaton has 2265 states and 5296 transitions. Word has length 95 [2019-12-28 03:41:26,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:26,314 INFO L462 AbstractCegarLoop]: Abstraction has 2265 states and 5296 transitions. [2019-12-28 03:41:26,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:41:26,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2265 states and 5296 transitions. [2019-12-28 03:41:26,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 03:41:26,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:26,319 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:26,319 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:26,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:26,320 INFO L82 PathProgramCache]: Analyzing trace with hash 756751223, now seen corresponding path program 1 times [2019-12-28 03:41:26,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:26,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857215768] [2019-12-28 03:41:26,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:26,428 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,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857215768] [2019-12-28 03:41:26,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:26,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:41:26,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1312438424] [2019-12-28 03:41:26,430 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:26,459 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:26,543 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 143 states and 187 transitions. [2019-12-28 03:41:26,543 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:26,588 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-28 03:41:26,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:41:26,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:26,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:41:26,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:41:26,589 INFO L87 Difference]: Start difference. First operand 2265 states and 5296 transitions. Second operand 7 states. [2019-12-28 03:41:26,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:26,808 INFO L93 Difference]: Finished difference Result 2257 states and 5272 transitions. [2019-12-28 03:41:26,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 03:41:26,808 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-28 03:41:26,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:26,812 INFO L225 Difference]: With dead ends: 2257 [2019-12-28 03:41:26,812 INFO L226 Difference]: Without dead ends: 2257 [2019-12-28 03:41:26,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:41:26,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2019-12-28 03:41:26,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2184. [2019-12-28 03:41:26,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2184 states. [2019-12-28 03:41:26,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 2184 states and 5106 transitions. [2019-12-28 03:41:26,843 INFO L78 Accepts]: Start accepts. Automaton has 2184 states and 5106 transitions. Word has length 97 [2019-12-28 03:41:26,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:26,843 INFO L462 AbstractCegarLoop]: Abstraction has 2184 states and 5106 transitions. [2019-12-28 03:41:26,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:41:26,844 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 5106 transitions. [2019-12-28 03:41:26,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 03:41:26,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:26,846 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:26,847 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:26,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:26,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1696531523, now seen corresponding path program 1 times [2019-12-28 03:41:26,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:26,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639699304] [2019-12-28 03:41:26,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:26,946 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,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639699304] [2019-12-28 03:41:26,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:26,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:41:26,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1645451437] [2019-12-28 03:41:26,947 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:26,962 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:27,037 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 205 transitions. [2019-12-28 03:41:27,037 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:27,079 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 03:41:27,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:41:27,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:27,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:41:27,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:41:27,080 INFO L87 Difference]: Start difference. First operand 2184 states and 5106 transitions. Second operand 8 states. [2019-12-28 03:41:27,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:27,428 INFO L93 Difference]: Finished difference Result 3550 states and 8326 transitions. [2019-12-28 03:41:27,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:41:27,428 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-28 03:41:27,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:27,434 INFO L225 Difference]: With dead ends: 3550 [2019-12-28 03:41:27,434 INFO L226 Difference]: Without dead ends: 3550 [2019-12-28 03:41:27,435 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:27,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3550 states. [2019-12-28 03:41:27,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3550 to 2146. [2019-12-28 03:41:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2146 states. [2019-12-28 03:41:27,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 4970 transitions. [2019-12-28 03:41:27,463 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 4970 transitions. Word has length 97 [2019-12-28 03:41:27,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:27,463 INFO L462 AbstractCegarLoop]: Abstraction has 2146 states and 4970 transitions. [2019-12-28 03:41:27,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:41:27,463 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 4970 transitions. [2019-12-28 03:41:27,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 03:41:27,465 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:27,465 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,465 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:27,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:27,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1415088476, now seen corresponding path program 1 times [2019-12-28 03:41:27,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:27,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300847973] [2019-12-28 03:41:27,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:41:27,595 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:27,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300847973] [2019-12-28 03:41:27,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:41:27,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 03:41:27,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1934470046] [2019-12-28 03:41:27,596 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:41:27,611 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:41:27,685 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 205 transitions. [2019-12-28 03:41:27,685 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:41:27,705 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:41:27,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 03:41:27,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:41:27,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 03:41:27,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:41:27,706 INFO L87 Difference]: Start difference. First operand 2146 states and 4970 transitions. Second operand 9 states. [2019-12-28 03:41:27,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:41:27,993 INFO L93 Difference]: Finished difference Result 3515 states and 8250 transitions. [2019-12-28 03:41:27,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 03:41:27,993 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-12-28 03:41:27,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:41:27,995 INFO L225 Difference]: With dead ends: 3515 [2019-12-28 03:41:27,995 INFO L226 Difference]: Without dead ends: 1453 [2019-12-28 03:41:27,996 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:27,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2019-12-28 03:41:28,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1365. [2019-12-28 03:41:28,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1365 states. [2019-12-28 03:41:28,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 3237 transitions. [2019-12-28 03:41:28,013 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 3237 transitions. Word has length 97 [2019-12-28 03:41:28,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:41:28,014 INFO L462 AbstractCegarLoop]: Abstraction has 1365 states and 3237 transitions. [2019-12-28 03:41:28,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 03:41:28,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 3237 transitions. [2019-12-28 03:41:28,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 03:41:28,016 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:41:28,016 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:28,016 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:28,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:41:28,017 INFO L82 PathProgramCache]: Analyzing trace with hash -466492236, now seen corresponding path program 2 times [2019-12-28 03:41:28,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:41:28,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067257519] [2019-12-28 03:41:28,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:41:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 03:41:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 03:41:28,106 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 03:41:28,107 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 03:41:28,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 03:41:28 BasicIcfg [2019-12-28 03:41:28,289 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 03:41:28,291 INFO L168 Benchmark]: Toolchain (without parser) took 65048.37 ms. Allocated memory was 144.7 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 101.1 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-28 03:41:28,291 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-28 03:41:28,292 INFO L168 Benchmark]: CACSL2BoogieTranslator took 834.28 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.6 MB in the beginning and 154.0 MB in the end (delta: -53.4 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2019-12-28 03:41:28,292 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.15 ms. Allocated memory is still 201.9 MB. Free memory was 154.0 MB in the beginning and 151.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-28 03:41:28,293 INFO L168 Benchmark]: Boogie Preprocessor took 38.58 ms. Allocated memory is still 201.9 MB. Free memory was 151.2 MB in the beginning and 149.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-28 03:41:28,293 INFO L168 Benchmark]: RCFGBuilder took 760.55 ms. Allocated memory is still 201.9 MB. Free memory was 148.4 MB in the beginning and 104.1 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2019-12-28 03:41:28,294 INFO L168 Benchmark]: TraceAbstraction took 63344.96 ms. Allocated memory was 201.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 103.4 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-28 03:41:28,296 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 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 834.28 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.6 MB in the beginning and 154.0 MB in the end (delta: -53.4 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.15 ms. Allocated memory is still 201.9 MB. Free memory was 154.0 MB in the beginning and 151.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.58 ms. Allocated memory is still 201.9 MB. Free memory was 151.2 MB in the beginning and 149.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 760.55 ms. Allocated memory is still 201.9 MB. Free memory was 148.4 MB in the beginning and 104.1 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 63344.96 ms. Allocated memory was 201.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 103.4 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 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 t1607; 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(&t1607, ((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 t1608; 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(&t1608, ((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: 63.0s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 26.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8198 SDtfs, 10710 SDslu, 21555 SDs, 0 SdLazy, 11435 SolverSat, 808 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 447 GetRequests, 143 SyntacticMatches, 25 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 3.6s 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: 27.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 121977 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s 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...