/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-10 17:35:07,593 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-10 17:35:07,595 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-10 17:35:07,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-10 17:35:07,615 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-10 17:35:07,618 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-10 17:35:07,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-10 17:35:07,623 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-10 17:35:07,625 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-10 17:35:07,628 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-10 17:35:07,628 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-10 17:35:07,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-10 17:35:07,630 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-10 17:35:07,631 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-10 17:35:07,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-10 17:35:07,633 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-10 17:35:07,635 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-10 17:35:07,635 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-10 17:35:07,637 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-10 17:35:07,643 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-10 17:35:07,644 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-10 17:35:07,644 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-10 17:35:07,645 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-10 17:35:07,647 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-10 17:35:07,651 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-10 17:35:07,651 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-10 17:35:07,651 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-10 17:35:07,652 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-10 17:35:07,653 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-10 17:35:07,653 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-10 17:35:07,653 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-10 17:35:07,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-10 17:35:07,655 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-10 17:35:07,655 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-10 17:35:07,656 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-10 17:35:07,656 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-10 17:35:07,657 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-10 17:35:07,657 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-10 17:35:07,657 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-10 17:35:07,657 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-10 17:35:07,658 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-10 17:35:07,658 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.epf [2021-03-10 17:35:07,685 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-10 17:35:07,686 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-10 17:35:07,686 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-03-10 17:35:07,686 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-03-10 17:35:07,688 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-10 17:35:07,688 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-10 17:35:07,689 INFO L138 SettingsManager]: * Use SBE=true [2021-03-10 17:35:07,689 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-10 17:35:07,689 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-10 17:35:07,689 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-10 17:35:07,690 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-10 17:35:07,690 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-10 17:35:07,690 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-10 17:35:07,690 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-10 17:35:07,690 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-10 17:35:07,690 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-10 17:35:07,690 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-10 17:35:07,690 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-10 17:35:07,691 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-10 17:35:07,691 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-10 17:35:07,691 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-10 17:35:07,691 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-10 17:35:07,691 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-10 17:35:07,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-10 17:35:07,691 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-10 17:35:07,691 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-10 17:35:07,692 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-10 17:35:07,692 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-10 17:35:07,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-10 17:35:07,692 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-03-10 17:35:07,692 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-03-10 17:35:07,692 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-10 17:35:07,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-10 17:35:07,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-10 17:35:07,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-10 17:35:07,974 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-10 17:35:07,974 INFO L275 PluginConnector]: CDTParser initialized [2021-03-10 17:35:07,974 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt.i [2021-03-10 17:35:08,021 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b4d2dfd5/fcc62a74e96149b7991cd3e8cc7bed20/FLAG756b12938 [2021-03-10 17:35:08,483 INFO L306 CDTParser]: Found 1 translation units. [2021-03-10 17:35:08,484 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt.i [2021-03-10 17:35:08,496 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b4d2dfd5/fcc62a74e96149b7991cd3e8cc7bed20/FLAG756b12938 [2021-03-10 17:35:08,510 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b4d2dfd5/fcc62a74e96149b7991cd3e8cc7bed20 [2021-03-10 17:35:08,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-10 17:35:08,516 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-10 17:35:08,518 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-10 17:35:08,518 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-10 17:35:08,521 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-10 17:35:08,521 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.03 05:35:08" (1/1) ... [2021-03-10 17:35:08,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70749176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:08, skipping insertion in model container [2021-03-10 17:35:08,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.03 05:35:08" (1/1) ... [2021-03-10 17:35:08,526 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-10 17:35:08,563 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-10 17:35:08,718 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt.i[951,964] [2021-03-10 17:35:08,877 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-10 17:35:08,885 INFO L203 MainTranslator]: Completed pre-run [2021-03-10 17:35:08,893 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt.i[951,964] [2021-03-10 17:35:08,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-10 17:35:08,995 INFO L208 MainTranslator]: Completed translation [2021-03-10 17:35:08,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:08 WrapperNode [2021-03-10 17:35:08,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-10 17:35:08,996 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-10 17:35:08,996 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-10 17:35:08,996 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-10 17:35:09,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:08" (1/1) ... [2021-03-10 17:35:09,010 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:08" (1/1) ... [2021-03-10 17:35:09,030 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-10 17:35:09,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-10 17:35:09,030 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-10 17:35:09,030 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-10 17:35:09,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:08" (1/1) ... [2021-03-10 17:35:09,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:08" (1/1) ... [2021-03-10 17:35:09,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:08" (1/1) ... [2021-03-10 17:35:09,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:08" (1/1) ... [2021-03-10 17:35:09,058 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:08" (1/1) ... [2021-03-10 17:35:09,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:08" (1/1) ... [2021-03-10 17:35:09,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:08" (1/1) ... [2021-03-10 17:35:09,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-10 17:35:09,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-10 17:35:09,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-10 17:35:09,065 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-10 17:35:09,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:08" (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 [2021-03-10 17:35:09,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-10 17:35:09,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-10 17:35:09,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-10 17:35:09,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-10 17:35:09,123 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-10 17:35:09,124 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-10 17:35:09,124 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-10 17:35:09,124 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-10 17:35:09,124 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-10 17:35:09,124 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-10 17:35:09,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-10 17:35:09,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-10 17:35:09,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-10 17:35:09,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-10 17:35:09,126 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-10 17:35:10,320 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-10 17:35:10,320 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-10 17:35:10,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.03 05:35:10 BoogieIcfgContainer [2021-03-10 17:35:10,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-10 17:35:10,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-10 17:35:10,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-10 17:35:10,324 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-10 17:35:10,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.03 05:35:08" (1/3) ... [2021-03-10 17:35:10,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263e1ec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.03 05:35:10, skipping insertion in model container [2021-03-10 17:35:10,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:08" (2/3) ... [2021-03-10 17:35:10,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263e1ec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.03 05:35:10, skipping insertion in model container [2021-03-10 17:35:10,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.03 05:35:10" (3/3) ... [2021-03-10 17:35:10,325 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_power.opt.i [2021-03-10 17:35:10,329 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-03-10 17:35:10,329 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-10 17:35:10,332 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-10 17:35:10,332 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-10 17:35:10,352 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,352 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,352 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,352 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,352 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,352 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,352 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,352 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,352 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,352 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,353 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,353 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,353 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,353 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,353 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,353 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,356 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,356 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,356 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,356 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,356 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,356 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,356 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,357 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,357 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,357 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,357 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,357 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,358 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,358 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,358 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,362 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,362 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,363 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,363 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,368 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,368 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,368 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:10,372 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-10 17:35:10,382 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-10 17:35:10,399 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-10 17:35:10,402 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-10 17:35:10,403 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-10 17:35:10,403 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-10 17:35:10,403 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-10 17:35:10,403 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-10 17:35:10,403 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-10 17:35:10,403 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-10 17:35:10,412 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 103 places, 95 transitions, 205 flow [2021-03-10 17:35:10,912 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 13392 states, 13388 states have (on average 3.634149985061249) internal successors, (48654), 13391 states have internal predecessors, (48654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:10,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 13392 states, 13388 states have (on average 3.634149985061249) internal successors, (48654), 13391 states have internal predecessors, (48654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:10,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-03-10 17:35:10,943 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:10,944 INFO L519 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] [2021-03-10 17:35:10,944 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:10,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:10,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1287208224, now seen corresponding path program 1 times [2021-03-10 17:35:10,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:10,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337402280] [2021-03-10 17:35:10,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:11,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:11,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:11,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337402280] [2021-03-10 17:35:11,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:11,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-10 17:35:11,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891107102] [2021-03-10 17:35:11,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-10 17:35:11,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:11,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-10 17:35:11,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-10 17:35:11,226 INFO L87 Difference]: Start difference. First operand has 13392 states, 13388 states have (on average 3.634149985061249) internal successors, (48654), 13391 states have internal predecessors, (48654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:11,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:11,415 INFO L93 Difference]: Finished difference Result 11488 states and 40652 transitions. [2021-03-10 17:35:11,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-10 17:35:11,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-03-10 17:35:11,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:11,465 INFO L225 Difference]: With dead ends: 11488 [2021-03-10 17:35:11,465 INFO L226 Difference]: Without dead ends: 6560 [2021-03-10 17:35:11,466 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-10 17:35:11,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6560 states. [2021-03-10 17:35:11,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6560 to 6560. [2021-03-10 17:35:11,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6560 states, 6559 states have (on average 3.487726787620064) internal successors, (22876), 6559 states have internal predecessors, (22876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:11,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6560 states to 6560 states and 22876 transitions. [2021-03-10 17:35:11,738 INFO L78 Accepts]: Start accepts. Automaton has 6560 states and 22876 transitions. Word has length 46 [2021-03-10 17:35:11,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:11,739 INFO L480 AbstractCegarLoop]: Abstraction has 6560 states and 22876 transitions. [2021-03-10 17:35:11,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:11,739 INFO L276 IsEmpty]: Start isEmpty. Operand 6560 states and 22876 transitions. [2021-03-10 17:35:11,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-03-10 17:35:11,749 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:11,750 INFO L519 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] [2021-03-10 17:35:11,750 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-10 17:35:11,750 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:11,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:11,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1259649930, now seen corresponding path program 1 times [2021-03-10 17:35:11,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:11,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211562292] [2021-03-10 17:35:11,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:11,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:11,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211562292] [2021-03-10 17:35:11,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:11,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-10 17:35:11,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458902283] [2021-03-10 17:35:11,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-10 17:35:11,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:11,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-10 17:35:11,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-10 17:35:11,898 INFO L87 Difference]: Start difference. First operand 6560 states and 22876 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:12,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:12,071 INFO L93 Difference]: Finished difference Result 8064 states and 27824 transitions. [2021-03-10 17:35:12,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 17:35:12,072 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-03-10 17:35:12,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:12,102 INFO L225 Difference]: With dead ends: 8064 [2021-03-10 17:35:12,102 INFO L226 Difference]: Without dead ends: 6272 [2021-03-10 17:35:12,103 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 111.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:35:12,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6272 states. [2021-03-10 17:35:12,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6272 to 6272. [2021-03-10 17:35:12,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6272 states, 6271 states have (on average 3.4699409982458937) internal successors, (21760), 6271 states have internal predecessors, (21760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:12,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6272 states to 6272 states and 21760 transitions. [2021-03-10 17:35:12,302 INFO L78 Accepts]: Start accepts. Automaton has 6272 states and 21760 transitions. Word has length 57 [2021-03-10 17:35:12,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:12,303 INFO L480 AbstractCegarLoop]: Abstraction has 6272 states and 21760 transitions. [2021-03-10 17:35:12,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:12,303 INFO L276 IsEmpty]: Start isEmpty. Operand 6272 states and 21760 transitions. [2021-03-10 17:35:12,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-03-10 17:35:12,313 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:12,313 INFO L519 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] [2021-03-10 17:35:12,313 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-10 17:35:12,313 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:12,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:12,322 INFO L82 PathProgramCache]: Analyzing trace with hash -564169529, now seen corresponding path program 1 times [2021-03-10 17:35:12,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:12,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562425586] [2021-03-10 17:35:12,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:12,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:12,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562425586] [2021-03-10 17:35:12,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:12,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-10 17:35:12,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457467226] [2021-03-10 17:35:12,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-10 17:35:12,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:12,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-10 17:35:12,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-10 17:35:12,429 INFO L87 Difference]: Start difference. First operand 6272 states and 21760 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:12,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:12,539 INFO L93 Difference]: Finished difference Result 7400 states and 25424 transitions. [2021-03-10 17:35:12,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 17:35:12,539 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-03-10 17:35:12,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:12,566 INFO L225 Difference]: With dead ends: 7400 [2021-03-10 17:35:12,566 INFO L226 Difference]: Without dead ends: 6056 [2021-03-10 17:35:12,566 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 63.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:35:12,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2021-03-10 17:35:12,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 6056. [2021-03-10 17:35:12,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6056 states, 6055 states have (on average 3.4569777043765484) internal successors, (20932), 6055 states have internal predecessors, (20932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:12,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6056 states to 6056 states and 20932 transitions. [2021-03-10 17:35:12,762 INFO L78 Accepts]: Start accepts. Automaton has 6056 states and 20932 transitions. Word has length 59 [2021-03-10 17:35:12,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:12,763 INFO L480 AbstractCegarLoop]: Abstraction has 6056 states and 20932 transitions. [2021-03-10 17:35:12,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:12,764 INFO L276 IsEmpty]: Start isEmpty. Operand 6056 states and 20932 transitions. [2021-03-10 17:35:12,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-03-10 17:35:12,781 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:12,782 INFO L519 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] [2021-03-10 17:35:12,782 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-10 17:35:12,783 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:12,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:12,783 INFO L82 PathProgramCache]: Analyzing trace with hash -92247609, now seen corresponding path program 1 times [2021-03-10 17:35:12,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:12,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69779996] [2021-03-10 17:35:12,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:12,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:12,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:12,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69779996] [2021-03-10 17:35:12,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:12,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-10 17:35:12,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93081465] [2021-03-10 17:35:12,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-10 17:35:12,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:12,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-10 17:35:12,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-10 17:35:12,891 INFO L87 Difference]: Start difference. First operand 6056 states and 20932 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:13,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:13,094 INFO L93 Difference]: Finished difference Result 10248 states and 34748 transitions. [2021-03-10 17:35:13,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 17:35:13,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-03-10 17:35:13,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:13,113 INFO L225 Difference]: With dead ends: 10248 [2021-03-10 17:35:13,113 INFO L226 Difference]: Without dead ends: 6824 [2021-03-10 17:35:13,114 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 126.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:35:13,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6824 states. [2021-03-10 17:35:13,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6824 to 5672. [2021-03-10 17:35:13,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5672 states, 5671 states have (on average 3.3736554399576795) internal successors, (19132), 5671 states have internal predecessors, (19132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:13,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5672 states to 5672 states and 19132 transitions. [2021-03-10 17:35:13,263 INFO L78 Accepts]: Start accepts. Automaton has 5672 states and 19132 transitions. Word has length 60 [2021-03-10 17:35:13,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:13,263 INFO L480 AbstractCegarLoop]: Abstraction has 5672 states and 19132 transitions. [2021-03-10 17:35:13,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:13,263 INFO L276 IsEmpty]: Start isEmpty. Operand 5672 states and 19132 transitions. [2021-03-10 17:35:13,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-03-10 17:35:13,271 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:13,272 INFO L519 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] [2021-03-10 17:35:13,272 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-10 17:35:13,272 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:13,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:13,272 INFO L82 PathProgramCache]: Analyzing trace with hash -774438042, now seen corresponding path program 1 times [2021-03-10 17:35:13,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:13,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568723271] [2021-03-10 17:35:13,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:13,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:13,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568723271] [2021-03-10 17:35:13,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:13,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-10 17:35:13,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018025200] [2021-03-10 17:35:13,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-10 17:35:13,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:13,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-10 17:35:13,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:35:13,432 INFO L87 Difference]: Start difference. First operand 5672 states and 19132 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:13,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:13,763 INFO L93 Difference]: Finished difference Result 6740 states and 22590 transitions. [2021-03-10 17:35:13,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-03-10 17:35:13,763 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-03-10 17:35:13,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:13,777 INFO L225 Difference]: With dead ends: 6740 [2021-03-10 17:35:13,777 INFO L226 Difference]: Without dead ends: 5540 [2021-03-10 17:35:13,778 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 184.3ms TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2021-03-10 17:35:13,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5540 states. [2021-03-10 17:35:13,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5540 to 5540. [2021-03-10 17:35:13,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5540 states, 5539 states have (on average 3.3630619245351148) internal successors, (18628), 5539 states have internal predecessors, (18628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:13,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5540 states to 5540 states and 18628 transitions. [2021-03-10 17:35:13,894 INFO L78 Accepts]: Start accepts. Automaton has 5540 states and 18628 transitions. Word has length 61 [2021-03-10 17:35:13,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:13,895 INFO L480 AbstractCegarLoop]: Abstraction has 5540 states and 18628 transitions. [2021-03-10 17:35:13,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:13,896 INFO L276 IsEmpty]: Start isEmpty. Operand 5540 states and 18628 transitions. [2021-03-10 17:35:13,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-03-10 17:35:13,903 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:13,903 INFO L519 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] [2021-03-10 17:35:13,903 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-10 17:35:13,903 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:13,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:13,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1233041822, now seen corresponding path program 1 times [2021-03-10 17:35:13,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:13,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588735541] [2021-03-10 17:35:13,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:14,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:14,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588735541] [2021-03-10 17:35:14,063 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:14,063 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-10 17:35:14,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772821890] [2021-03-10 17:35:14,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-10 17:35:14,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:14,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-10 17:35:14,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-03-10 17:35:14,064 INFO L87 Difference]: Start difference. First operand 5540 states and 18628 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:14,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:14,383 INFO L93 Difference]: Finished difference Result 6280 states and 20990 transitions. [2021-03-10 17:35:14,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 17:35:14,383 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-03-10 17:35:14,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:14,398 INFO L225 Difference]: With dead ends: 6280 [2021-03-10 17:35:14,399 INFO L226 Difference]: Without dead ends: 5480 [2021-03-10 17:35:14,399 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 185.0ms TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2021-03-10 17:35:14,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5480 states. [2021-03-10 17:35:14,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5480 to 5480. [2021-03-10 17:35:14,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5480 states, 5479 states have (on average 3.3582770578572734) internal successors, (18400), 5479 states have internal predecessors, (18400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:14,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5480 states to 5480 states and 18400 transitions. [2021-03-10 17:35:14,488 INFO L78 Accepts]: Start accepts. Automaton has 5480 states and 18400 transitions. Word has length 62 [2021-03-10 17:35:14,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:14,489 INFO L480 AbstractCegarLoop]: Abstraction has 5480 states and 18400 transitions. [2021-03-10 17:35:14,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:14,489 INFO L276 IsEmpty]: Start isEmpty. Operand 5480 states and 18400 transitions. [2021-03-10 17:35:14,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-03-10 17:35:14,496 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:14,496 INFO L519 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] [2021-03-10 17:35:14,496 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-10 17:35:14,496 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:14,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:14,497 INFO L82 PathProgramCache]: Analyzing trace with hash 547959975, now seen corresponding path program 1 times [2021-03-10 17:35:14,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:14,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750192360] [2021-03-10 17:35:14,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:14,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:14,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750192360] [2021-03-10 17:35:14,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:14,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-03-10 17:35:14,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388884095] [2021-03-10 17:35:14,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-03-10 17:35:14,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:14,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-03-10 17:35:14,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2021-03-10 17:35:14,698 INFO L87 Difference]: Start difference. First operand 5480 states and 18400 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:14,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:14,943 INFO L93 Difference]: Finished difference Result 5880 states and 19620 transitions. [2021-03-10 17:35:14,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 17:35:14,944 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-03-10 17:35:14,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:14,957 INFO L225 Difference]: With dead ends: 5880 [2021-03-10 17:35:14,957 INFO L226 Difference]: Without dead ends: 5240 [2021-03-10 17:35:14,958 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 194.5ms TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2021-03-10 17:35:14,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5240 states. [2021-03-10 17:35:15,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5240 to 5240. [2021-03-10 17:35:15,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5240 states, 5239 states have (on average 3.3494941782782974) internal successors, (17548), 5239 states have internal predecessors, (17548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:15,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5240 states to 5240 states and 17548 transitions. [2021-03-10 17:35:15,082 INFO L78 Accepts]: Start accepts. Automaton has 5240 states and 17548 transitions. Word has length 63 [2021-03-10 17:35:15,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:15,083 INFO L480 AbstractCegarLoop]: Abstraction has 5240 states and 17548 transitions. [2021-03-10 17:35:15,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:15,083 INFO L276 IsEmpty]: Start isEmpty. Operand 5240 states and 17548 transitions. [2021-03-10 17:35:15,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-03-10 17:35:15,090 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:15,090 INFO L519 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] [2021-03-10 17:35:15,090 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-10 17:35:15,090 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:15,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:15,091 INFO L82 PathProgramCache]: Analyzing trace with hash -160508859, now seen corresponding path program 1 times [2021-03-10 17:35:15,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:15,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236785653] [2021-03-10 17:35:15,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:15,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:15,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236785653] [2021-03-10 17:35:15,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:15,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-10 17:35:15,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353744038] [2021-03-10 17:35:15,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-10 17:35:15,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:15,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-10 17:35:15,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-10 17:35:15,160 INFO L87 Difference]: Start difference. First operand 5240 states and 17548 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:15,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:15,264 INFO L93 Difference]: Finished difference Result 8634 states and 28496 transitions. [2021-03-10 17:35:15,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 17:35:15,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-03-10 17:35:15,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:15,275 INFO L225 Difference]: With dead ends: 8634 [2021-03-10 17:35:15,275 INFO L226 Difference]: Without dead ends: 5642 [2021-03-10 17:35:15,275 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 73.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:35:15,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2021-03-10 17:35:15,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 4892. [2021-03-10 17:35:15,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4892 states, 4891 states have (on average 3.264772030259661) internal successors, (15968), 4891 states have internal predecessors, (15968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:15,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4892 states to 4892 states and 15968 transitions. [2021-03-10 17:35:15,354 INFO L78 Accepts]: Start accepts. Automaton has 4892 states and 15968 transitions. Word has length 63 [2021-03-10 17:35:15,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:15,354 INFO L480 AbstractCegarLoop]: Abstraction has 4892 states and 15968 transitions. [2021-03-10 17:35:15,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:15,354 INFO L276 IsEmpty]: Start isEmpty. Operand 4892 states and 15968 transitions. [2021-03-10 17:35:15,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-03-10 17:35:15,361 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:15,361 INFO L519 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] [2021-03-10 17:35:15,361 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-10 17:35:15,361 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:15,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:15,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1871770688, now seen corresponding path program 1 times [2021-03-10 17:35:15,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:15,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527604685] [2021-03-10 17:35:15,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:15,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:15,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527604685] [2021-03-10 17:35:15,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:15,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-10 17:35:15,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976936378] [2021-03-10 17:35:15,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-10 17:35:15,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:15,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-10 17:35:15,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-03-10 17:35:15,509 INFO L87 Difference]: Start difference. First operand 4892 states and 15968 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:15,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:15,797 INFO L93 Difference]: Finished difference Result 5586 states and 18168 transitions. [2021-03-10 17:35:15,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 17:35:15,801 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-03-10 17:35:15,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:15,826 INFO L225 Difference]: With dead ends: 5586 [2021-03-10 17:35:15,826 INFO L226 Difference]: Without dead ends: 4986 [2021-03-10 17:35:15,827 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 145.8ms TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2021-03-10 17:35:15,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4986 states. [2021-03-10 17:35:15,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4986 to 4986. [2021-03-10 17:35:15,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4986 states, 4985 states have (on average 3.260180541624875) internal successors, (16252), 4985 states have internal predecessors, (16252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:15,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4986 states to 4986 states and 16252 transitions. [2021-03-10 17:35:15,961 INFO L78 Accepts]: Start accepts. Automaton has 4986 states and 16252 transitions. Word has length 64 [2021-03-10 17:35:15,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:15,961 INFO L480 AbstractCegarLoop]: Abstraction has 4986 states and 16252 transitions. [2021-03-10 17:35:15,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:15,962 INFO L276 IsEmpty]: Start isEmpty. Operand 4986 states and 16252 transitions. [2021-03-10 17:35:15,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-03-10 17:35:15,972 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:15,972 INFO L519 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] [2021-03-10 17:35:15,972 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-10 17:35:15,972 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:15,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:15,973 INFO L82 PathProgramCache]: Analyzing trace with hash 2060250176, now seen corresponding path program 2 times [2021-03-10 17:35:15,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:15,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609475559] [2021-03-10 17:35:15,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:16,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:16,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609475559] [2021-03-10 17:35:16,180 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:16,180 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-10 17:35:16,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957737705] [2021-03-10 17:35:16,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-10 17:35:16,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:16,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-10 17:35:16,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:35:16,181 INFO L87 Difference]: Start difference. First operand 4986 states and 16252 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:16,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:16,520 INFO L93 Difference]: Finished difference Result 5596 states and 18190 transitions. [2021-03-10 17:35:16,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 17:35:16,521 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-03-10 17:35:16,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:16,531 INFO L225 Difference]: With dead ends: 5596 [2021-03-10 17:35:16,531 INFO L226 Difference]: Without dead ends: 4996 [2021-03-10 17:35:16,531 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 282.2ms TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2021-03-10 17:35:16,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4996 states. [2021-03-10 17:35:16,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4996 to 4972. [2021-03-10 17:35:16,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4972 states, 4971 states have (on average 3.2617179641923153) internal successors, (16214), 4971 states have internal predecessors, (16214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:16,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4972 states to 4972 states and 16214 transitions. [2021-03-10 17:35:16,624 INFO L78 Accepts]: Start accepts. Automaton has 4972 states and 16214 transitions. Word has length 64 [2021-03-10 17:35:16,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:16,624 INFO L480 AbstractCegarLoop]: Abstraction has 4972 states and 16214 transitions. [2021-03-10 17:35:16,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:16,625 INFO L276 IsEmpty]: Start isEmpty. Operand 4972 states and 16214 transitions. [2021-03-10 17:35:16,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-03-10 17:35:16,632 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:16,632 INFO L519 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] [2021-03-10 17:35:16,632 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-10 17:35:16,632 INFO L428 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:16,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:16,633 INFO L82 PathProgramCache]: Analyzing trace with hash 591160980, now seen corresponding path program 3 times [2021-03-10 17:35:16,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:16,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184859633] [2021-03-10 17:35:16,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:16,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:16,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184859633] [2021-03-10 17:35:16,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:16,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-10 17:35:16,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146084302] [2021-03-10 17:35:16,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-10 17:35:16,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:16,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-10 17:35:16,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-03-10 17:35:16,762 INFO L87 Difference]: Start difference. First operand 4972 states and 16214 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:17,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:17,003 INFO L93 Difference]: Finished difference Result 5936 states and 19344 transitions. [2021-03-10 17:35:17,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 17:35:17,004 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-03-10 17:35:17,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:17,012 INFO L225 Difference]: With dead ends: 5936 [2021-03-10 17:35:17,012 INFO L226 Difference]: Without dead ends: 5256 [2021-03-10 17:35:17,013 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 160.0ms TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2021-03-10 17:35:17,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5256 states. [2021-03-10 17:35:17,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5256 to 5056. [2021-03-10 17:35:17,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5056 states, 5055 states have (on average 3.2617210682492583) internal successors, (16488), 5055 states have internal predecessors, (16488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:17,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5056 states to 5056 states and 16488 transitions. [2021-03-10 17:35:17,102 INFO L78 Accepts]: Start accepts. Automaton has 5056 states and 16488 transitions. Word has length 64 [2021-03-10 17:35:17,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:17,102 INFO L480 AbstractCegarLoop]: Abstraction has 5056 states and 16488 transitions. [2021-03-10 17:35:17,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:17,103 INFO L276 IsEmpty]: Start isEmpty. Operand 5056 states and 16488 transitions. [2021-03-10 17:35:17,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-03-10 17:35:17,111 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:17,111 INFO L519 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] [2021-03-10 17:35:17,111 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-10 17:35:17,111 INFO L428 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:17,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:17,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1189537929, now seen corresponding path program 1 times [2021-03-10 17:35:17,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:17,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442877527] [2021-03-10 17:35:17,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:17,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:17,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442877527] [2021-03-10 17:35:17,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:17,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-03-10 17:35:17,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506886589] [2021-03-10 17:35:17,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-10 17:35:17,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:17,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-10 17:35:17,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-03-10 17:35:17,282 INFO L87 Difference]: Start difference. First operand 5056 states and 16488 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:17,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:17,567 INFO L93 Difference]: Finished difference Result 6006 states and 19342 transitions. [2021-03-10 17:35:17,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 17:35:17,568 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-03-10 17:35:17,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:17,576 INFO L225 Difference]: With dead ends: 6006 [2021-03-10 17:35:17,576 INFO L226 Difference]: Without dead ends: 5276 [2021-03-10 17:35:17,576 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 221.0ms TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2021-03-10 17:35:17,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5276 states. [2021-03-10 17:35:17,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5276 to 5276. [2021-03-10 17:35:17,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5276 states, 5275 states have (on average 3.223507109004739) internal successors, (17004), 5275 states have internal predecessors, (17004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:17,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5276 states to 5276 states and 17004 transitions. [2021-03-10 17:35:17,658 INFO L78 Accepts]: Start accepts. Automaton has 5276 states and 17004 transitions. Word has length 65 [2021-03-10 17:35:17,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:17,658 INFO L480 AbstractCegarLoop]: Abstraction has 5276 states and 17004 transitions. [2021-03-10 17:35:17,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:17,659 INFO L276 IsEmpty]: Start isEmpty. Operand 5276 states and 17004 transitions. [2021-03-10 17:35:17,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-03-10 17:35:17,667 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:17,667 INFO L519 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] [2021-03-10 17:35:17,667 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-10 17:35:17,667 INFO L428 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:17,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:17,668 INFO L82 PathProgramCache]: Analyzing trace with hash 826591497, now seen corresponding path program 2 times [2021-03-10 17:35:17,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:17,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271883757] [2021-03-10 17:35:17,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:17,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:17,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271883757] [2021-03-10 17:35:17,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:17,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-03-10 17:35:17,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806217626] [2021-03-10 17:35:17,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-10 17:35:17,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:17,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-10 17:35:17,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-03-10 17:35:17,833 INFO L87 Difference]: Start difference. First operand 5276 states and 17004 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:18,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:18,199 INFO L93 Difference]: Finished difference Result 6128 states and 19656 transitions. [2021-03-10 17:35:18,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 17:35:18,199 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-03-10 17:35:18,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:18,207 INFO L225 Difference]: With dead ends: 6128 [2021-03-10 17:35:18,207 INFO L226 Difference]: Without dead ends: 5228 [2021-03-10 17:35:18,207 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 306.4ms TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2021-03-10 17:35:18,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5228 states. [2021-03-10 17:35:18,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5228 to 4860. [2021-03-10 17:35:18,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4860 states, 4859 states have (on average 3.2327639431981887) internal successors, (15708), 4859 states have internal predecessors, (15708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:18,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4860 states to 4860 states and 15708 transitions. [2021-03-10 17:35:18,285 INFO L78 Accepts]: Start accepts. Automaton has 4860 states and 15708 transitions. Word has length 65 [2021-03-10 17:35:18,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:18,285 INFO L480 AbstractCegarLoop]: Abstraction has 4860 states and 15708 transitions. [2021-03-10 17:35:18,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:18,285 INFO L276 IsEmpty]: Start isEmpty. Operand 4860 states and 15708 transitions. [2021-03-10 17:35:18,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-03-10 17:35:18,292 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:18,293 INFO L519 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] [2021-03-10 17:35:18,293 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-10 17:35:18,293 INFO L428 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:18,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:18,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1449003747, now seen corresponding path program 3 times [2021-03-10 17:35:18,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:18,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414283839] [2021-03-10 17:35:18,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:18,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:18,519 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414283839] [2021-03-10 17:35:18,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:18,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-03-10 17:35:18,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229810599] [2021-03-10 17:35:18,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-10 17:35:18,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:18,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-10 17:35:18,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-03-10 17:35:18,521 INFO L87 Difference]: Start difference. First operand 4860 states and 15708 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:18,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:18,786 INFO L93 Difference]: Finished difference Result 5552 states and 17844 transitions. [2021-03-10 17:35:18,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-03-10 17:35:18,786 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-03-10 17:35:18,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:18,794 INFO L225 Difference]: With dead ends: 5552 [2021-03-10 17:35:18,794 INFO L226 Difference]: Without dead ends: 4947 [2021-03-10 17:35:18,794 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 234.9ms TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2021-03-10 17:35:18,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4947 states. [2021-03-10 17:35:18,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4947 to 4756. [2021-03-10 17:35:18,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4756 states, 4755 states have (on average 3.237223974763407) internal successors, (15393), 4755 states have internal predecessors, (15393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:18,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4756 states to 4756 states and 15393 transitions. [2021-03-10 17:35:18,866 INFO L78 Accepts]: Start accepts. Automaton has 4756 states and 15393 transitions. Word has length 65 [2021-03-10 17:35:18,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:18,866 INFO L480 AbstractCegarLoop]: Abstraction has 4756 states and 15393 transitions. [2021-03-10 17:35:18,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:18,867 INFO L276 IsEmpty]: Start isEmpty. Operand 4756 states and 15393 transitions. [2021-03-10 17:35:18,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-03-10 17:35:18,873 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:18,873 INFO L519 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] [2021-03-10 17:35:18,873 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-10 17:35:18,873 INFO L428 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:18,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:18,874 INFO L82 PathProgramCache]: Analyzing trace with hash -456321079, now seen corresponding path program 4 times [2021-03-10 17:35:18,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:18,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633199329] [2021-03-10 17:35:18,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:18,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:19,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:19,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633199329] [2021-03-10 17:35:19,042 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:19,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-03-10 17:35:19,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837811971] [2021-03-10 17:35:19,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-10 17:35:19,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:19,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-10 17:35:19,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-03-10 17:35:19,043 INFO L87 Difference]: Start difference. First operand 4756 states and 15393 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:19,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:19,299 INFO L93 Difference]: Finished difference Result 6812 states and 21819 transitions. [2021-03-10 17:35:19,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 17:35:19,300 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-03-10 17:35:19,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:19,306 INFO L225 Difference]: With dead ends: 6812 [2021-03-10 17:35:19,306 INFO L226 Difference]: Without dead ends: 4252 [2021-03-10 17:35:19,306 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 216.5ms TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2021-03-10 17:35:19,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4252 states. [2021-03-10 17:35:19,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4252 to 3452. [2021-03-10 17:35:19,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3452 states, 3451 states have (on average 3.202549985511446) internal successors, (11052), 3451 states have internal predecessors, (11052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:19,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 11052 transitions. [2021-03-10 17:35:19,359 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 11052 transitions. Word has length 65 [2021-03-10 17:35:19,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:19,359 INFO L480 AbstractCegarLoop]: Abstraction has 3452 states and 11052 transitions. [2021-03-10 17:35:19,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:19,359 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 11052 transitions. [2021-03-10 17:35:19,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-03-10 17:35:19,363 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:19,363 INFO L519 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] [2021-03-10 17:35:19,363 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-10 17:35:19,363 INFO L428 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:19,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:19,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1075263533, now seen corresponding path program 1 times [2021-03-10 17:35:19,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:19,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181324841] [2021-03-10 17:35:19,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:19,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:19,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181324841] [2021-03-10 17:35:19,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:19,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-10 17:35:19,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594409675] [2021-03-10 17:35:19,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-10 17:35:19,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:19,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-10 17:35:19,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-10 17:35:19,422 INFO L87 Difference]: Start difference. First operand 3452 states and 11052 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:19,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:19,514 INFO L93 Difference]: Finished difference Result 4308 states and 13492 transitions. [2021-03-10 17:35:19,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 17:35:19,514 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-03-10 17:35:19,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:19,518 INFO L225 Difference]: With dead ends: 4308 [2021-03-10 17:35:19,518 INFO L226 Difference]: Without dead ends: 2996 [2021-03-10 17:35:19,518 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 68.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:35:19,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2996 states. [2021-03-10 17:35:19,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2996 to 2996. [2021-03-10 17:35:19,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2996 states, 2995 states have (on average 3.1312186978297163) internal successors, (9378), 2995 states have internal predecessors, (9378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:19,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2996 states to 2996 states and 9378 transitions. [2021-03-10 17:35:19,557 INFO L78 Accepts]: Start accepts. Automaton has 2996 states and 9378 transitions. Word has length 65 [2021-03-10 17:35:19,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:19,557 INFO L480 AbstractCegarLoop]: Abstraction has 2996 states and 9378 transitions. [2021-03-10 17:35:19,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:19,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2996 states and 9378 transitions. [2021-03-10 17:35:19,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-03-10 17:35:19,561 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:19,561 INFO L519 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] [2021-03-10 17:35:19,561 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-10 17:35:19,561 INFO L428 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:19,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:19,561 INFO L82 PathProgramCache]: Analyzing trace with hash 366201433, now seen corresponding path program 1 times [2021-03-10 17:35:19,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:19,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106028829] [2021-03-10 17:35:19,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:19,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:19,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106028829] [2021-03-10 17:35:19,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:19,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-10 17:35:19,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089186068] [2021-03-10 17:35:19,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-10 17:35:19,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:19,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-10 17:35:19,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-10 17:35:19,625 INFO L87 Difference]: Start difference. First operand 2996 states and 9378 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:19,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:19,727 INFO L93 Difference]: Finished difference Result 3038 states and 9208 transitions. [2021-03-10 17:35:19,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 17:35:19,727 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-03-10 17:35:19,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:19,730 INFO L225 Difference]: With dead ends: 3038 [2021-03-10 17:35:19,730 INFO L226 Difference]: Without dead ends: 1982 [2021-03-10 17:35:19,731 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 74.4ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-03-10 17:35:19,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2021-03-10 17:35:19,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1982. [2021-03-10 17:35:19,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1982 states, 1981 states have (on average 2.9813225643614336) internal successors, (5906), 1981 states have internal predecessors, (5906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:19,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 5906 transitions. [2021-03-10 17:35:19,755 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 5906 transitions. Word has length 66 [2021-03-10 17:35:19,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:19,756 INFO L480 AbstractCegarLoop]: Abstraction has 1982 states and 5906 transitions. [2021-03-10 17:35:19,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:19,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 5906 transitions. [2021-03-10 17:35:19,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-03-10 17:35:19,759 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:19,759 INFO L519 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] [2021-03-10 17:35:19,759 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-10 17:35:19,759 INFO L428 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:19,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:19,760 INFO L82 PathProgramCache]: Analyzing trace with hash -423742292, now seen corresponding path program 1 times [2021-03-10 17:35:19,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:19,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553983919] [2021-03-10 17:35:19,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:19,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 17:35:19,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553983919] [2021-03-10 17:35:19,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:19,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-10 17:35:19,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195042846] [2021-03-10 17:35:19,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-10 17:35:19,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:19,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-10 17:35:19,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-10 17:35:19,832 INFO L87 Difference]: Start difference. First operand 1982 states and 5906 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:19,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:19,940 INFO L93 Difference]: Finished difference Result 1568 states and 4499 transitions. [2021-03-10 17:35:19,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 17:35:19,940 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-03-10 17:35:19,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:19,941 INFO L225 Difference]: With dead ends: 1568 [2021-03-10 17:35:19,941 INFO L226 Difference]: Without dead ends: 644 [2021-03-10 17:35:19,941 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 92.2ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-03-10 17:35:19,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2021-03-10 17:35:19,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2021-03-10 17:35:19,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 643 states have (on average 2.7371695178849142) internal successors, (1760), 643 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:19,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1760 transitions. [2021-03-10 17:35:19,950 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1760 transitions. Word has length 68 [2021-03-10 17:35:19,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:19,950 INFO L480 AbstractCegarLoop]: Abstraction has 644 states and 1760 transitions. [2021-03-10 17:35:19,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 17:35:19,950 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1760 transitions. [2021-03-10 17:35:19,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-03-10 17:35:19,951 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:19,951 INFO L519 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] [2021-03-10 17:35:19,951 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-10 17:35:19,952 INFO L428 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:19,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:19,952 INFO L82 PathProgramCache]: Analyzing trace with hash 2001921525, now seen corresponding path program 1 times [2021-03-10 17:35:19,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:19,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287842253] [2021-03-10 17:35:19,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-10 17:35:19,977 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-10 17:35:20,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-10 17:35:20,005 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-10 17:35:20,038 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-10 17:35:20,039 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-10 17:35:20,039 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-10 17:35:20,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.03 05:35:20 BasicIcfg [2021-03-10 17:35:20,125 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-10 17:35:20,126 INFO L168 Benchmark]: Toolchain (without parser) took 11612.46 ms. Allocated memory was 255.9 MB in the beginning and 3.1 GB in the end (delta: 2.8 GB). Free memory was 233.5 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.6 GB. Max. memory is 16.0 GB. [2021-03-10 17:35:20,126 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-10 17:35:20,126 INFO L168 Benchmark]: CACSL2BoogieTranslator took 477.44 ms. Allocated memory was 255.9 MB in the beginning and 348.1 MB in the end (delta: 92.3 MB). Free memory was 232.8 MB in the beginning and 308.2 MB in the end (delta: -75.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-10 17:35:20,126 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.87 ms. Allocated memory is still 348.1 MB. Free memory was 308.2 MB in the beginning and 305.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-10 17:35:20,126 INFO L168 Benchmark]: Boogie Preprocessor took 33.97 ms. Allocated memory is still 348.1 MB. Free memory was 305.1 MB in the beginning and 303.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-10 17:35:20,126 INFO L168 Benchmark]: RCFGBuilder took 1256.33 ms. Allocated memory is still 348.1 MB. Free memory was 303.0 MB in the beginning and 268.0 MB in the end (delta: 35.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 16.0 GB. [2021-03-10 17:35:20,126 INFO L168 Benchmark]: TraceAbstraction took 9803.49 ms. Allocated memory was 348.1 MB in the beginning and 3.1 GB in the end (delta: 2.8 GB). Free memory was 267.0 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 16.0 GB. [2021-03-10 17:35:20,127 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 477.44 ms. Allocated memory was 255.9 MB in the beginning and 348.1 MB in the end (delta: 92.3 MB). Free memory was 232.8 MB in the beginning and 308.2 MB in the end (delta: -75.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 33.87 ms. Allocated memory is still 348.1 MB. Free memory was 308.2 MB in the beginning and 305.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 33.97 ms. Allocated memory is still 348.1 MB. Free memory was 305.1 MB in the beginning and 303.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1256.33 ms. Allocated memory is still 348.1 MB. Free memory was 303.0 MB in the beginning and 268.0 MB in the end (delta: 35.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 9803.49 ms. Allocated memory was 348.1 MB in the beginning and 3.1 GB in the end (delta: 2.8 GB). Free memory was 267.0 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L711] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L713] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L716] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L717] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L718] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=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] [L719] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L720] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L721] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=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_buff0_thd3=0] [L722] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0] [L723] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L724] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L725] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L726] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L727] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L728] 0 int y$w_buff0; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L729] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L730] 0 int y$w_buff1; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L731] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L733] 0 int z = 0; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L811] 0 pthread_t t2492; VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L813] 0 pthread_t t2493; VAL [__unbuffered_cnt=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L815] 0 pthread_t t2494; VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L786] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L739] 1 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2] [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2] [L760] 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) [L760] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L760] 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) [L760] 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) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 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 [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 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 [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2] [L822] 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) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] 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) [L822] 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) [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 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 [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L826] 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 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] 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) [L833] 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) [L834] 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)) [L834] EXPR 0 !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) [L834] 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)) [L834] 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)) [L835] 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)) [L835] EXPR 0 !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) [L835] 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)) [L835] 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)) [L836] 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)) [L836] EXPR 0 !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) [L836] 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)) [L836] 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)) [L837] 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)) [L837] EXPR 0 !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) [L837] 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)) [L837] 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)) [L838] 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)) [L838] EXPR 0 !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) [L838] 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)) [L838] 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)) [L839] 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)) [L839] EXPR 0 !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) [L839] 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)) [L839] 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)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 94 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9642.4ms, OverallIterations: 19, TraceHistogramMax: 1, EmptinessCheckTime: 163.2ms, AutomataDifference: 4331.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 509.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2314 SDtfs, 3548 SDslu, 9919 SDs, 0 SdLazy, 1479 SolverSat, 289 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1334.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 277 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 2749.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=13392occurred in iteration=0, InterpolantAutomatonStates: 210, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1884.9ms AutomataMinimizationTime, 18 MinimizatonAttempts, 3485 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 48.9ms SsaConstructionTime, 479.5ms SatisfiabilityAnalysisTime, 1952.6ms InterpolantComputationTime, 1193 NumberOfCodeBlocks, 1193 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1104 ConstructedInterpolants, 0 QuantifiedInterpolants, 6495 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...