/usr/bin/java -Xmx8000000000 -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/mix057_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-12 17:09:58,956 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-12 17:09:58,957 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-12 17:09:58,983 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-12 17:09:58,983 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-12 17:09:58,986 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-12 17:09:58,988 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-12 17:09:58,992 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-12 17:09:58,994 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-12 17:09:58,997 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-12 17:09:58,998 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-12 17:09:58,999 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-12 17:09:58,999 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-12 17:09:59,001 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-12 17:09:59,003 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-12 17:09:59,004 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-12 17:09:59,006 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-12 17:09:59,007 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-12 17:09:59,009 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-12 17:09:59,015 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-12 17:09:59,016 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-12 17:09:59,017 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-12 17:09:59,018 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-12 17:09:59,020 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-12 17:09:59,024 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-12 17:09:59,025 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-12 17:09:59,025 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-12 17:09:59,026 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-12 17:09:59,026 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-12 17:09:59,027 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-12 17:09:59,027 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-12 17:09:59,028 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-12 17:09:59,029 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-12 17:09:59,029 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-12 17:09:59,030 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-12 17:09:59,030 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-12 17:09:59,031 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-12 17:09:59,031 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-12 17:09:59,031 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-12 17:09:59,032 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-12 17:09:59,032 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-12 17:09:59,033 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-08-12 17:09:59,067 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-12 17:09:59,067 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-12 17:09:59,067 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-12 17:09:59,068 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-12 17:09:59,070 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-12 17:09:59,070 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-12 17:09:59,070 INFO L138 SettingsManager]: * Use SBE=true [2021-08-12 17:09:59,070 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-12 17:09:59,071 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-12 17:09:59,071 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-12 17:09:59,071 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-12 17:09:59,072 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-12 17:09:59,072 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-12 17:09:59,072 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-12 17:09:59,072 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-12 17:09:59,072 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-12 17:09:59,072 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-12 17:09:59,072 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-12 17:09:59,072 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-12 17:09:59,073 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-12 17:09:59,073 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-12 17:09:59,073 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-12 17:09:59,073 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-12 17:09:59,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-12 17:09:59,073 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-12 17:09:59,073 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-12 17:09:59,073 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-12 17:09:59,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-12 17:09:59,074 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-12 17:09:59,074 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-12 17:09:59,074 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-08-12 17:09:59,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-12 17:09:59,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-12 17:09:59,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-12 17:09:59,348 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-12 17:09:59,348 INFO L275 PluginConnector]: CDTParser initialized [2021-08-12 17:09:59,349 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i [2021-08-12 17:09:59,396 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c0611bd6/3fd38f743ab0455986aa821c626caf65/FLAGa05045ecc [2021-08-12 17:09:59,828 INFO L306 CDTParser]: Found 1 translation units. [2021-08-12 17:09:59,828 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i [2021-08-12 17:09:59,842 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c0611bd6/3fd38f743ab0455986aa821c626caf65/FLAGa05045ecc [2021-08-12 17:10:00,175 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c0611bd6/3fd38f743ab0455986aa821c626caf65 [2021-08-12 17:10:00,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-12 17:10:00,179 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-12 17:10:00,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-12 17:10:00,182 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-12 17:10:00,185 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-12 17:10:00,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 05:10:00" (1/1) ... [2021-08-12 17:10:00,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43016e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:10:00, skipping insertion in model container [2021-08-12 17:10:00,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 05:10:00" (1/1) ... [2021-08-12 17:10:00,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-12 17:10:00,230 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-12 17:10:00,380 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i[948,961] [2021-08-12 17:10:00,521 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-12 17:10:00,528 INFO L203 MainTranslator]: Completed pre-run [2021-08-12 17:10:00,543 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i[948,961] [2021-08-12 17:10:00,596 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-12 17:10:00,642 INFO L208 MainTranslator]: Completed translation [2021-08-12 17:10:00,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:10:00 WrapperNode [2021-08-12 17:10:00,644 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-12 17:10:00,645 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-12 17:10:00,645 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-12 17:10:00,645 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-12 17:10:00,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:10:00" (1/1) ... [2021-08-12 17:10:00,661 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:10:00" (1/1) ... [2021-08-12 17:10:00,684 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-12 17:10:00,685 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-12 17:10:00,685 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-12 17:10:00,685 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-12 17:10:00,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:10:00" (1/1) ... [2021-08-12 17:10:00,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:10:00" (1/1) ... [2021-08-12 17:10:00,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:10:00" (1/1) ... [2021-08-12 17:10:00,694 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:10:00" (1/1) ... [2021-08-12 17:10:00,701 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:10:00" (1/1) ... [2021-08-12 17:10:00,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:10:00" (1/1) ... [2021-08-12 17:10:00,706 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:10:00" (1/1) ... [2021-08-12 17:10:00,709 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-12 17:10:00,710 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-12 17:10:00,710 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-12 17:10:00,710 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-12 17:10:00,710 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:10:00" (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-08-12 17:10:00,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-12 17:10:00,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-12 17:10:00,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-12 17:10:00,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-12 17:10:00,769 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-12 17:10:00,769 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-12 17:10:00,769 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-12 17:10:00,769 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-12 17:10:00,770 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-12 17:10:00,770 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-12 17:10:00,770 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-08-12 17:10:00,770 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-08-12 17:10:00,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-12 17:10:00,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-12 17:10:00,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-12 17:10:00,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-12 17:10:00,772 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-12 17:10:02,169 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-12 17:10:02,170 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-12 17:10:02,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 05:10:02 BoogieIcfgContainer [2021-08-12 17:10:02,171 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-12 17:10:02,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-12 17:10:02,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-12 17:10:02,175 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-12 17:10:02,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.08 05:10:00" (1/3) ... [2021-08-12 17:10:02,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d204a25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 05:10:02, skipping insertion in model container [2021-08-12 17:10:02,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 05:10:00" (2/3) ... [2021-08-12 17:10:02,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d204a25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 05:10:02, skipping insertion in model container [2021-08-12 17:10:02,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 05:10:02" (3/3) ... [2021-08-12 17:10:02,177 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_pso.opt.i [2021-08-12 17:10:02,181 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-12 17:10:02,182 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-12 17:10:02,182 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-12 17:10:02,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,208 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,208 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,208 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,208 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,209 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,209 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,210 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,210 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,212 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,212 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,212 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,212 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,214 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,214 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,214 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,214 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,214 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,214 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,214 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,214 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,215 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,215 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,215 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,215 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,215 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,215 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,215 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,215 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,215 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,216 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,216 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,216 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,216 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,216 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,216 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,216 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,216 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,216 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,217 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,217 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,217 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,217 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,217 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,218 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,218 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,218 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,218 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,219 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,219 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,219 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,219 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,221 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,221 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,221 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,221 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,221 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,221 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,221 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,222 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,222 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,222 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,222 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,222 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,224 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,226 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,226 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,226 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,231 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,232 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,232 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,233 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,233 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,233 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,234 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 17:10:02,234 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-12 17:10:02,249 INFO L255 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-08-12 17:10:02,269 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-12 17:10:02,269 INFO L379 AbstractCegarLoop]: Hoare is true [2021-08-12 17:10:02,269 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-12 17:10:02,269 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-12 17:10:02,269 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-12 17:10:02,269 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-12 17:10:02,269 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-12 17:10:02,270 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-12 17:10:02,278 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 135 places, 124 transitions, 268 flow [2021-08-12 17:10:21,844 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 105490 states, 105486 states have (on average 4.4803291432038375) internal successors, (472612), 105489 states have internal predecessors, (472612), 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-08-12 17:10:22,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 105490 states, 105486 states have (on average 4.4803291432038375) internal successors, (472612), 105489 states have internal predecessors, (472612), 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-08-12 17:10:22,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-08-12 17:10:22,300 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:10:22,301 INFO L550 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-08-12 17:10:22,301 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:10:22,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:10:22,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1183912701, now seen corresponding path program 1 times [2021-08-12 17:10:22,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:10:22,310 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881246280] [2021-08-12 17:10:22,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:10:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:10:22,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:10:22,521 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:10:22,521 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881246280] [2021-08-12 17:10:22,522 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881246280] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:10:22,522 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:10:22,522 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-12 17:10:22,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719263992] [2021-08-12 17:10:22,525 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-12 17:10:22,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:10:22,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-12 17:10:22,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-12 17:10:22,703 INFO L87 Difference]: Start difference. First operand has 105490 states, 105486 states have (on average 4.4803291432038375) internal successors, (472612), 105489 states have internal predecessors, (472612), 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 32.5) internal successors, (65), 3 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-08-12 17:10:26,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:10:26,062 INFO L93 Difference]: Finished difference Result 168210 states and 760452 transitions. [2021-08-12 17:10:26,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-12 17:10:26,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 32.5) internal successors, (65), 3 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-08-12 17:10:26,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:10:26,796 INFO L225 Difference]: With dead ends: 168210 [2021-08-12 17:10:26,797 INFO L226 Difference]: Without dead ends: 50218 [2021-08-12 17:10:26,925 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-12 17:10:27,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50218 states. [2021-08-12 17:10:28,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50218 to 50218. [2021-08-12 17:10:29,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50218 states, 50217 states have (on average 4.336718641097637) internal successors, (217777), 50217 states have internal predecessors, (217777), 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-08-12 17:10:29,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50218 states to 50218 states and 217777 transitions. [2021-08-12 17:10:29,726 INFO L78 Accepts]: Start accepts. Automaton has 50218 states and 217777 transitions. Word has length 65 [2021-08-12 17:10:29,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:10:29,729 INFO L482 AbstractCegarLoop]: Abstraction has 50218 states and 217777 transitions. [2021-08-12 17:10:29,729 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 32.5) internal successors, (65), 3 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-08-12 17:10:29,729 INFO L276 IsEmpty]: Start isEmpty. Operand 50218 states and 217777 transitions. [2021-08-12 17:10:29,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-12 17:10:29,779 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:10:29,779 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:10:29,779 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-12 17:10:29,780 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:10:29,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:10:29,782 INFO L82 PathProgramCache]: Analyzing trace with hash -715615938, now seen corresponding path program 1 times [2021-08-12 17:10:29,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:10:29,782 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694140475] [2021-08-12 17:10:29,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:10:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:10:29,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:10:29,971 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:10:29,971 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694140475] [2021-08-12 17:10:29,971 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694140475] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:10:29,972 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:10:29,972 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 17:10:29,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209944058] [2021-08-12 17:10:29,974 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 17:10:29,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:10:29,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 17:10:29,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 17:10:29,975 INFO L87 Difference]: Start difference. First operand 50218 states and 217777 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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-08-12 17:10:31,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:10:31,649 INFO L93 Difference]: Finished difference Result 67018 states and 289437 transitions. [2021-08-12 17:10:31,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 17:10:31,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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 77 [2021-08-12 17:10:31,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:10:32,142 INFO L225 Difference]: With dead ends: 67018 [2021-08-12 17:10:32,142 INFO L226 Difference]: Without dead ends: 48202 [2021-08-12 17:10:32,189 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 77.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-12 17:10:32,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48202 states. [2021-08-12 17:10:33,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48202 to 48202. [2021-08-12 17:10:33,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48202 states, 48201 states have (on average 4.320180079251468) internal successors, (208237), 48201 states have internal predecessors, (208237), 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-08-12 17:10:34,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48202 states to 48202 states and 208237 transitions. [2021-08-12 17:10:34,341 INFO L78 Accepts]: Start accepts. Automaton has 48202 states and 208237 transitions. Word has length 77 [2021-08-12 17:10:34,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:10:34,342 INFO L482 AbstractCegarLoop]: Abstraction has 48202 states and 208237 transitions. [2021-08-12 17:10:34,342 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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-08-12 17:10:34,342 INFO L276 IsEmpty]: Start isEmpty. Operand 48202 states and 208237 transitions. [2021-08-12 17:10:34,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-08-12 17:10:34,392 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:10:34,392 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:10:34,392 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-12 17:10:34,393 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:10:34,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:10:34,393 INFO L82 PathProgramCache]: Analyzing trace with hash 114274397, now seen corresponding path program 1 times [2021-08-12 17:10:34,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:10:34,393 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402912655] [2021-08-12 17:10:34,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:10:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:10:34,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:10:34,585 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:10:34,585 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402912655] [2021-08-12 17:10:34,585 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402912655] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:10:34,585 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:10:34,585 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 17:10:34,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792327151] [2021-08-12 17:10:34,586 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 17:10:34,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:10:34,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 17:10:34,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 17:10:34,587 INFO L87 Difference]: Start difference. First operand 48202 states and 208237 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-08-12 17:10:35,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:10:35,838 INFO L93 Difference]: Finished difference Result 60586 states and 260449 transitions. [2021-08-12 17:10:35,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 17:10:35,839 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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 79 [2021-08-12 17:10:35,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:10:36,147 INFO L225 Difference]: With dead ends: 60586 [2021-08-12 17:10:36,147 INFO L226 Difference]: Without dead ends: 46474 [2021-08-12 17:10:36,184 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 86.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-12 17:10:36,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46474 states. [2021-08-12 17:10:37,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46474 to 46474. [2021-08-12 17:10:37,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46474 states, 46473 states have (on average 4.305747423234997) internal successors, (200101), 46473 states have internal predecessors, (200101), 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-08-12 17:10:37,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46474 states to 46474 states and 200101 transitions. [2021-08-12 17:10:38,040 INFO L78 Accepts]: Start accepts. Automaton has 46474 states and 200101 transitions. Word has length 79 [2021-08-12 17:10:38,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:10:38,041 INFO L482 AbstractCegarLoop]: Abstraction has 46474 states and 200101 transitions. [2021-08-12 17:10:38,041 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-08-12 17:10:38,041 INFO L276 IsEmpty]: Start isEmpty. Operand 46474 states and 200101 transitions. [2021-08-12 17:10:38,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-08-12 17:10:38,093 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:10:38,093 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:10:38,094 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-12 17:10:38,094 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:10:38,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:10:38,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1940160349, now seen corresponding path program 1 times [2021-08-12 17:10:38,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:10:38,094 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375352282] [2021-08-12 17:10:38,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:10:38,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:10:38,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:10:38,189 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:10:38,189 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375352282] [2021-08-12 17:10:38,190 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375352282] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:10:38,190 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:10:38,190 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 17:10:38,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999745047] [2021-08-12 17:10:38,190 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 17:10:38,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:10:38,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 17:10:38,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 17:10:38,191 INFO L87 Difference]: Start difference. First operand 46474 states and 200101 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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-08-12 17:10:39,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:10:39,829 INFO L93 Difference]: Finished difference Result 81250 states and 346459 transitions. [2021-08-12 17:10:39,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 17:10:39,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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 80 [2021-08-12 17:10:39,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:10:40,165 INFO L225 Difference]: With dead ends: 81250 [2021-08-12 17:10:40,165 INFO L226 Difference]: Without dead ends: 51850 [2021-08-12 17:10:40,210 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 74.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-12 17:10:40,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51850 states. [2021-08-12 17:10:41,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51850 to 43786. [2021-08-12 17:10:41,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43786 states, 43785 states have (on average 4.219138974534658) internal successors, (184735), 43785 states have internal predecessors, (184735), 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-08-12 17:10:42,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43786 states to 43786 states and 184735 transitions. [2021-08-12 17:10:42,221 INFO L78 Accepts]: Start accepts. Automaton has 43786 states and 184735 transitions. Word has length 80 [2021-08-12 17:10:42,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:10:42,222 INFO L482 AbstractCegarLoop]: Abstraction has 43786 states and 184735 transitions. [2021-08-12 17:10:42,222 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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-08-12 17:10:42,222 INFO L276 IsEmpty]: Start isEmpty. Operand 43786 states and 184735 transitions. [2021-08-12 17:10:42,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-08-12 17:10:42,273 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:10:42,274 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:10:42,274 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-12 17:10:42,274 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:10:42,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:10:42,274 INFO L82 PathProgramCache]: Analyzing trace with hash -849332228, now seen corresponding path program 1 times [2021-08-12 17:10:42,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:10:42,274 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078075597] [2021-08-12 17:10:42,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:10:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:10:42,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:10:42,435 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:10:42,435 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078075597] [2021-08-12 17:10:42,435 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078075597] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:10:42,435 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:10:42,435 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-12 17:10:42,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583141250] [2021-08-12 17:10:42,436 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-12 17:10:42,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:10:42,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-12 17:10:42,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-12 17:10:42,436 INFO L87 Difference]: Start difference. First operand 43786 states and 184735 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 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-08-12 17:10:43,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:10:43,857 INFO L93 Difference]: Finished difference Result 55948 states and 235785 transitions. [2021-08-12 17:10:43,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-12 17:10:43,858 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 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 81 [2021-08-12 17:10:43,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:10:44,145 INFO L225 Difference]: With dead ends: 55948 [2021-08-12 17:10:44,145 INFO L226 Difference]: Without dead ends: 43564 [2021-08-12 17:10:44,174 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 147.4ms TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-08-12 17:10:44,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43564 states. [2021-08-12 17:10:45,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43564 to 43270. [2021-08-12 17:10:45,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43270 states, 43269 states have (on average 4.213709584228893) internal successors, (182323), 43269 states have internal predecessors, (182323), 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-08-12 17:10:45,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43270 states to 43270 states and 182323 transitions. [2021-08-12 17:10:45,751 INFO L78 Accepts]: Start accepts. Automaton has 43270 states and 182323 transitions. Word has length 81 [2021-08-12 17:10:45,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:10:45,751 INFO L482 AbstractCegarLoop]: Abstraction has 43270 states and 182323 transitions. [2021-08-12 17:10:45,752 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 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-08-12 17:10:45,752 INFO L276 IsEmpty]: Start isEmpty. Operand 43270 states and 182323 transitions. [2021-08-12 17:10:46,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-08-12 17:10:46,079 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:10:46,079 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:10:46,080 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-12 17:10:46,080 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:10:46,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:10:46,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1733770590, now seen corresponding path program 1 times [2021-08-12 17:10:46,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:10:46,081 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959642189] [2021-08-12 17:10:46,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:10:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:10:46,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:10:46,239 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:10:46,239 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959642189] [2021-08-12 17:10:46,240 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959642189] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:10:46,240 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:10:46,240 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-12 17:10:46,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346827656] [2021-08-12 17:10:46,240 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-12 17:10:46,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:10:46,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-12 17:10:46,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-08-12 17:10:46,241 INFO L87 Difference]: Start difference. First operand 43270 states and 182323 transitions. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 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-08-12 17:10:47,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:10:47,612 INFO L93 Difference]: Finished difference Result 51108 states and 214811 transitions. [2021-08-12 17:10:47,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-12 17:10:47,614 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 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 82 [2021-08-12 17:10:47,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:10:47,893 INFO L225 Difference]: With dead ends: 51108 [2021-08-12 17:10:47,893 INFO L226 Difference]: Without dead ends: 40788 [2021-08-12 17:10:47,916 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 168.2ms TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2021-08-12 17:10:48,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40788 states. [2021-08-12 17:10:49,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40788 to 40690. [2021-08-12 17:10:49,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40690 states, 40689 states have (on average 4.197178598638453) internal successors, (170779), 40689 states have internal predecessors, (170779), 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-08-12 17:10:49,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40690 states to 40690 states and 170779 transitions. [2021-08-12 17:10:49,409 INFO L78 Accepts]: Start accepts. Automaton has 40690 states and 170779 transitions. Word has length 82 [2021-08-12 17:10:49,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:10:49,409 INFO L482 AbstractCegarLoop]: Abstraction has 40690 states and 170779 transitions. [2021-08-12 17:10:49,409 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 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-08-12 17:10:49,409 INFO L276 IsEmpty]: Start isEmpty. Operand 40690 states and 170779 transitions. [2021-08-12 17:10:49,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-08-12 17:10:49,701 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:10:49,702 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:10:49,702 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-12 17:10:49,702 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:10:49,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:10:49,702 INFO L82 PathProgramCache]: Analyzing trace with hash -2019794338, now seen corresponding path program 1 times [2021-08-12 17:10:49,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:10:49,712 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875604513] [2021-08-12 17:10:49,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:10:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:10:49,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:10:49,928 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:10:49,928 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875604513] [2021-08-12 17:10:49,928 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875604513] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:10:49,928 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:10:49,928 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-12 17:10:49,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15420924] [2021-08-12 17:10:49,928 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-08-12 17:10:49,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:10:49,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-12 17:10:49,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-08-12 17:10:49,929 INFO L87 Difference]: Start difference. First operand 40690 states and 170779 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 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-08-12 17:10:51,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:10:51,061 INFO L93 Difference]: Finished difference Result 49462 states and 207225 transitions. [2021-08-12 17:10:51,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-12 17:10:51,062 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 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 83 [2021-08-12 17:10:51,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:10:51,348 INFO L225 Difference]: With dead ends: 49462 [2021-08-12 17:10:51,348 INFO L226 Difference]: Without dead ends: 40174 [2021-08-12 17:10:51,368 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 139.6ms TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2021-08-12 17:10:51,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40174 states. [2021-08-12 17:10:52,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40174 to 40174. [2021-08-12 17:10:52,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40174 states, 40173 states have (on average 4.1910487143106065) internal successors, (168367), 40173 states have internal predecessors, (168367), 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-08-12 17:10:52,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40174 states to 40174 states and 168367 transitions. [2021-08-12 17:10:52,937 INFO L78 Accepts]: Start accepts. Automaton has 40174 states and 168367 transitions. Word has length 83 [2021-08-12 17:10:52,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:10:52,938 INFO L482 AbstractCegarLoop]: Abstraction has 40174 states and 168367 transitions. [2021-08-12 17:10:52,938 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 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-08-12 17:10:52,938 INFO L276 IsEmpty]: Start isEmpty. Operand 40174 states and 168367 transitions. [2021-08-12 17:10:53,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-12 17:10:53,005 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:10:53,005 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:10:53,005 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-12 17:10:53,006 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:10:53,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:10:53,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1561535612, now seen corresponding path program 1 times [2021-08-12 17:10:53,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:10:53,007 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257576273] [2021-08-12 17:10:53,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:10:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:10:53,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:10:53,218 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:10:53,218 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257576273] [2021-08-12 17:10:53,218 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257576273] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:10:53,218 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:10:53,218 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-12 17:10:53,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994201103] [2021-08-12 17:10:53,218 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-08-12 17:10:53,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:10:53,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-12 17:10:53,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-08-12 17:10:53,219 INFO L87 Difference]: Start difference. First operand 40174 states and 168367 transitions. Second operand has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 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-08-12 17:10:54,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:10:54,974 INFO L93 Difference]: Finished difference Result 53798 states and 226075 transitions. [2021-08-12 17:10:54,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-12 17:10:54,975 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 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 84 [2021-08-12 17:10:54,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:10:55,383 INFO L225 Difference]: With dead ends: 53798 [2021-08-12 17:10:55,384 INFO L226 Difference]: Without dead ends: 44682 [2021-08-12 17:10:55,405 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 159.9ms TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2021-08-12 17:10:55,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44682 states. [2021-08-12 17:10:56,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44682 to 44584. [2021-08-12 17:10:56,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44584 states, 44583 states have (on average 4.197900545050804) internal successors, (187155), 44583 states have internal predecessors, (187155), 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-08-12 17:10:57,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44584 states to 44584 states and 187155 transitions. [2021-08-12 17:10:57,341 INFO L78 Accepts]: Start accepts. Automaton has 44584 states and 187155 transitions. Word has length 84 [2021-08-12 17:10:57,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:10:57,341 INFO L482 AbstractCegarLoop]: Abstraction has 44584 states and 187155 transitions. [2021-08-12 17:10:57,341 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 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-08-12 17:10:57,342 INFO L276 IsEmpty]: Start isEmpty. Operand 44584 states and 187155 transitions. [2021-08-12 17:10:57,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-12 17:10:57,418 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:10:57,418 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:10:57,418 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-12 17:10:57,418 INFO L430 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:10:57,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:10:57,419 INFO L82 PathProgramCache]: Analyzing trace with hash -458379468, now seen corresponding path program 2 times [2021-08-12 17:10:57,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:10:57,419 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953693159] [2021-08-12 17:10:57,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:10:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:10:57,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:10:57,550 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:10:57,550 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953693159] [2021-08-12 17:10:57,550 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953693159] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:10:57,550 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:10:57,550 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-12 17:10:57,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965195051] [2021-08-12 17:10:57,551 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-08-12 17:10:57,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:10:57,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-12 17:10:57,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-12 17:10:57,551 INFO L87 Difference]: Start difference. First operand 44584 states and 187155 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 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-08-12 17:10:59,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:10:59,643 INFO L93 Difference]: Finished difference Result 55292 states and 231918 transitions. [2021-08-12 17:10:59,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-12 17:10:59,644 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 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 84 [2021-08-12 17:10:59,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:10:59,983 INFO L225 Difference]: With dead ends: 55292 [2021-08-12 17:10:59,984 INFO L226 Difference]: Without dead ends: 46864 [2021-08-12 17:11:00,008 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 183.4ms TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2021-08-12 17:11:00,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46864 states. [2021-08-12 17:11:01,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46864 to 44950. [2021-08-12 17:11:01,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44950 states, 44949 states have (on average 4.187768359696545) internal successors, (188236), 44949 states have internal predecessors, (188236), 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-08-12 17:11:01,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44950 states to 44950 states and 188236 transitions. [2021-08-12 17:11:02,120 INFO L78 Accepts]: Start accepts. Automaton has 44950 states and 188236 transitions. Word has length 84 [2021-08-12 17:11:02,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:11:02,120 INFO L482 AbstractCegarLoop]: Abstraction has 44950 states and 188236 transitions. [2021-08-12 17:11:02,120 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 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-08-12 17:11:02,121 INFO L276 IsEmpty]: Start isEmpty. Operand 44950 states and 188236 transitions. [2021-08-12 17:11:02,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-12 17:11:02,192 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:11:02,192 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:11:02,192 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-12 17:11:02,192 INFO L430 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:11:02,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:11:02,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1750242831, now seen corresponding path program 1 times [2021-08-12 17:11:02,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:11:02,193 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349094968] [2021-08-12 17:11:02,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:11:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:11:02,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:11:02,369 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:11:02,369 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349094968] [2021-08-12 17:11:02,369 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349094968] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:11:02,369 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:11:02,369 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-12 17:11:02,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803640078] [2021-08-12 17:11:02,369 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-08-12 17:11:02,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:11:02,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-12 17:11:02,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-08-12 17:11:02,370 INFO L87 Difference]: Start difference. First operand 44950 states and 188236 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 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-08-12 17:11:04,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:11:04,655 INFO L93 Difference]: Finished difference Result 55552 states and 232700 transitions. [2021-08-12 17:11:04,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-12 17:11:04,656 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 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 85 [2021-08-12 17:11:04,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:11:04,979 INFO L225 Difference]: With dead ends: 55552 [2021-08-12 17:11:04,979 INFO L226 Difference]: Without dead ends: 49360 [2021-08-12 17:11:05,002 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 208.2ms TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2021-08-12 17:11:05,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49360 states. [2021-08-12 17:11:06,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49360 to 45832. [2021-08-12 17:11:06,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45832 states, 45831 states have (on average 4.193013462503545) internal successors, (192170), 45831 states have internal predecessors, (192170), 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-08-12 17:11:06,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45832 states to 45832 states and 192170 transitions. [2021-08-12 17:11:07,120 INFO L78 Accepts]: Start accepts. Automaton has 45832 states and 192170 transitions. Word has length 85 [2021-08-12 17:11:07,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:11:07,121 INFO L482 AbstractCegarLoop]: Abstraction has 45832 states and 192170 transitions. [2021-08-12 17:11:07,121 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 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-08-12 17:11:07,121 INFO L276 IsEmpty]: Start isEmpty. Operand 45832 states and 192170 transitions. [2021-08-12 17:11:07,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-12 17:11:07,194 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:11:07,194 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:11:07,194 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-12 17:11:07,195 INFO L430 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:11:07,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:11:07,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1156020575, now seen corresponding path program 1 times [2021-08-12 17:11:07,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:11:07,195 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835607979] [2021-08-12 17:11:07,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:11:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:11:07,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:11:07,260 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:11:07,260 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835607979] [2021-08-12 17:11:07,260 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835607979] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:11:07,260 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:11:07,260 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 17:11:07,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470243820] [2021-08-12 17:11:07,260 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 17:11:07,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:11:07,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 17:11:07,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 17:11:07,261 INFO L87 Difference]: Start difference. First operand 45832 states and 192170 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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-08-12 17:11:10,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:11:10,046 INFO L93 Difference]: Finished difference Result 73840 states and 308822 transitions. [2021-08-12 17:11:10,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 17:11:10,047 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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 85 [2021-08-12 17:11:10,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:11:10,345 INFO L225 Difference]: With dead ends: 73840 [2021-08-12 17:11:10,346 INFO L226 Difference]: Without dead ends: 42652 [2021-08-12 17:11:10,391 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 62.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-12 17:11:10,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42652 states. [2021-08-12 17:11:11,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42652 to 42652. [2021-08-12 17:11:12,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42652 states, 42651 states have (on average 4.144099786640407) internal successors, (176750), 42651 states have internal predecessors, (176750), 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-08-12 17:11:12,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42652 states to 42652 states and 176750 transitions. [2021-08-12 17:11:12,330 INFO L78 Accepts]: Start accepts. Automaton has 42652 states and 176750 transitions. Word has length 85 [2021-08-12 17:11:12,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:11:12,331 INFO L482 AbstractCegarLoop]: Abstraction has 42652 states and 176750 transitions. [2021-08-12 17:11:12,331 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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-08-12 17:11:12,331 INFO L276 IsEmpty]: Start isEmpty. Operand 42652 states and 176750 transitions. [2021-08-12 17:11:12,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-08-12 17:11:12,397 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:11:12,397 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:11:12,397 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-12 17:11:12,397 INFO L430 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:11:12,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:11:12,398 INFO L82 PathProgramCache]: Analyzing trace with hash -262332207, now seen corresponding path program 1 times [2021-08-12 17:11:12,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:11:12,398 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274208346] [2021-08-12 17:11:12,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:11:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:11:12,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:11:12,462 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:11:12,462 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274208346] [2021-08-12 17:11:12,463 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274208346] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:11:12,464 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:11:12,464 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-12 17:11:12,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741288713] [2021-08-12 17:11:12,465 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-12 17:11:12,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:11:12,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-12 17:11:12,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-12 17:11:12,465 INFO L87 Difference]: Start difference. First operand 42652 states and 176750 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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-08-12 17:11:14,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:11:14,785 INFO L93 Difference]: Finished difference Result 60796 states and 249866 transitions. [2021-08-12 17:11:14,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-12 17:11:14,785 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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 86 [2021-08-12 17:11:14,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:11:15,041 INFO L225 Difference]: With dead ends: 60796 [2021-08-12 17:11:15,042 INFO L226 Difference]: Without dead ends: 32788 [2021-08-12 17:11:15,078 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 74.8ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-08-12 17:11:15,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32788 states. [2021-08-12 17:11:16,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32788 to 32788. [2021-08-12 17:11:16,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32788 states, 32787 states have (on average 4.02202092292677) internal successors, (131870), 32787 states have internal predecessors, (131870), 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-08-12 17:11:16,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32788 states to 32788 states and 131870 transitions. [2021-08-12 17:11:16,518 INFO L78 Accepts]: Start accepts. Automaton has 32788 states and 131870 transitions. Word has length 86 [2021-08-12 17:11:16,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:11:16,519 INFO L482 AbstractCegarLoop]: Abstraction has 32788 states and 131870 transitions. [2021-08-12 17:11:16,519 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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-08-12 17:11:16,519 INFO L276 IsEmpty]: Start isEmpty. Operand 32788 states and 131870 transitions. [2021-08-12 17:11:16,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-12 17:11:16,575 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:11:16,575 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:11:16,575 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-12 17:11:16,575 INFO L430 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:11:16,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:11:16,576 INFO L82 PathProgramCache]: Analyzing trace with hash 397022798, now seen corresponding path program 1 times [2021-08-12 17:11:16,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:11:16,576 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477332201] [2021-08-12 17:11:16,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:11:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:11:16,828 WARN L205 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2021-08-12 17:11:16,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:11:16,844 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:11:16,844 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477332201] [2021-08-12 17:11:16,844 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477332201] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:11:16,844 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:11:16,845 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 17:11:16,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866199633] [2021-08-12 17:11:16,845 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 17:11:16,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:11:16,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 17:11:16,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 17:11:16,846 INFO L87 Difference]: Start difference. First operand 32788 states and 131870 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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-08-12 17:11:18,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:11:18,975 INFO L93 Difference]: Finished difference Result 53110 states and 211513 transitions. [2021-08-12 17:11:18,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 17:11:18,976 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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 88 [2021-08-12 17:11:18,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:11:19,232 INFO L225 Difference]: With dead ends: 53110 [2021-08-12 17:11:19,233 INFO L226 Difference]: Without dead ends: 34084 [2021-08-12 17:11:19,266 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 288.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-12 17:11:19,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34084 states. [2021-08-12 17:11:20,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34084 to 31582. [2021-08-12 17:11:20,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31582 states, 31581 states have (on average 3.9405971945156897) internal successors, (124448), 31581 states have internal predecessors, (124448), 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-08-12 17:11:20,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31582 states to 31582 states and 124448 transitions. [2021-08-12 17:11:20,837 INFO L78 Accepts]: Start accepts. Automaton has 31582 states and 124448 transitions. Word has length 88 [2021-08-12 17:11:20,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:11:20,839 INFO L482 AbstractCegarLoop]: Abstraction has 31582 states and 124448 transitions. [2021-08-12 17:11:20,839 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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-08-12 17:11:20,839 INFO L276 IsEmpty]: Start isEmpty. Operand 31582 states and 124448 transitions. [2021-08-12 17:11:20,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-12 17:11:20,905 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:11:20,905 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:11:20,905 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-12 17:11:20,905 INFO L430 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:11:20,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:11:20,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1585346414, now seen corresponding path program 1 times [2021-08-12 17:11:20,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:11:20,906 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088728957] [2021-08-12 17:11:20,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:11:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:11:21,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:11:21,022 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:11:21,022 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088728957] [2021-08-12 17:11:21,022 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088728957] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:11:21,022 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:11:21,023 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-12 17:11:21,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204318283] [2021-08-12 17:11:21,023 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-12 17:11:21,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:11:21,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-12 17:11:21,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-12 17:11:21,023 INFO L87 Difference]: Start difference. First operand 31582 states and 124448 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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-08-12 17:11:22,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:11:22,713 INFO L93 Difference]: Finished difference Result 37900 states and 148424 transitions. [2021-08-12 17:11:22,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-12 17:11:22,714 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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 88 [2021-08-12 17:11:22,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:11:22,934 INFO L225 Difference]: With dead ends: 37900 [2021-08-12 17:11:22,935 INFO L226 Difference]: Without dead ends: 20278 [2021-08-12 17:11:22,967 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 89.7ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-08-12 17:11:23,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20278 states. [2021-08-12 17:11:23,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20278 to 19018. [2021-08-12 17:11:23,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19018 states, 19017 states have (on average 3.7966030393858126) internal successors, (72200), 19017 states have internal predecessors, (72200), 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-08-12 17:11:23,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19018 states to 19018 states and 72200 transitions. [2021-08-12 17:11:23,893 INFO L78 Accepts]: Start accepts. Automaton has 19018 states and 72200 transitions. Word has length 88 [2021-08-12 17:11:23,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:11:23,893 INFO L482 AbstractCegarLoop]: Abstraction has 19018 states and 72200 transitions. [2021-08-12 17:11:23,894 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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-08-12 17:11:23,894 INFO L276 IsEmpty]: Start isEmpty. Operand 19018 states and 72200 transitions. [2021-08-12 17:11:23,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-08-12 17:11:23,923 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:11:23,923 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:11:23,923 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-12 17:11:23,923 INFO L430 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:11:23,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:11:23,923 INFO L82 PathProgramCache]: Analyzing trace with hash -108580821, now seen corresponding path program 1 times [2021-08-12 17:11:23,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:11:23,923 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213838946] [2021-08-12 17:11:23,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:11:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:11:23,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:11:23,996 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:11:23,996 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213838946] [2021-08-12 17:11:23,996 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213838946] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:11:23,997 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:11:23,997 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-12 17:11:23,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548080568] [2021-08-12 17:11:23,997 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-08-12 17:11:23,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:11:23,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-12 17:11:23,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-08-12 17:11:23,998 INFO L87 Difference]: Start difference. First operand 19018 states and 72200 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 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-08-12 17:11:25,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:11:25,097 INFO L93 Difference]: Finished difference Result 19990 states and 75683 transitions. [2021-08-12 17:11:25,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-12 17:11:25,098 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 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 91 [2021-08-12 17:11:25,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:11:25,276 INFO L225 Difference]: With dead ends: 19990 [2021-08-12 17:11:25,277 INFO L226 Difference]: Without dead ends: 7057 [2021-08-12 17:11:25,291 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 97.2ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-08-12 17:11:25,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7057 states. [2021-08-12 17:11:25,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7057 to 6385. [2021-08-12 17:11:25,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6385 states, 6384 states have (on average 3.6608709273182956) internal successors, (23371), 6384 states have internal predecessors, (23371), 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-08-12 17:11:25,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6385 states to 6385 states and 23371 transitions. [2021-08-12 17:11:25,625 INFO L78 Accepts]: Start accepts. Automaton has 6385 states and 23371 transitions. Word has length 91 [2021-08-12 17:11:25,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:11:25,625 INFO L482 AbstractCegarLoop]: Abstraction has 6385 states and 23371 transitions. [2021-08-12 17:11:25,626 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 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-08-12 17:11:25,626 INFO L276 IsEmpty]: Start isEmpty. Operand 6385 states and 23371 transitions. [2021-08-12 17:11:25,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-08-12 17:11:25,635 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:11:25,635 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:11:25,635 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-12 17:11:25,635 INFO L430 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:11:25,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:11:25,635 INFO L82 PathProgramCache]: Analyzing trace with hash 670995757, now seen corresponding path program 1 times [2021-08-12 17:11:25,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:11:25,636 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691479610] [2021-08-12 17:11:25,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:11:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:11:25,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:11:25,710 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:11:25,710 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691479610] [2021-08-12 17:11:25,711 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691479610] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:11:25,711 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:11:25,711 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-12 17:11:25,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808155226] [2021-08-12 17:11:25,711 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-12 17:11:25,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:11:25,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-12 17:11:25,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-12 17:11:25,712 INFO L87 Difference]: Start difference. First operand 6385 states and 23371 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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-08-12 17:11:26,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:11:26,334 INFO L93 Difference]: Finished difference Result 9697 states and 35857 transitions. [2021-08-12 17:11:26,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-12 17:11:26,335 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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 95 [2021-08-12 17:11:26,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:11:26,475 INFO L225 Difference]: With dead ends: 9697 [2021-08-12 17:11:26,476 INFO L226 Difference]: Without dead ends: 3644 [2021-08-12 17:11:26,482 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 62.1ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-08-12 17:11:26,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3644 states. [2021-08-12 17:11:26,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3644 to 3644. [2021-08-12 17:11:26,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3644 states, 3643 states have (on average 3.675267636563272) internal successors, (13389), 3643 states have internal predecessors, (13389), 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-08-12 17:11:26,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3644 states to 3644 states and 13389 transitions. [2021-08-12 17:11:26,720 INFO L78 Accepts]: Start accepts. Automaton has 3644 states and 13389 transitions. Word has length 95 [2021-08-12 17:11:26,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:11:26,720 INFO L482 AbstractCegarLoop]: Abstraction has 3644 states and 13389 transitions. [2021-08-12 17:11:26,721 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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-08-12 17:11:26,721 INFO L276 IsEmpty]: Start isEmpty. Operand 3644 states and 13389 transitions. [2021-08-12 17:11:26,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-08-12 17:11:26,726 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:11:26,726 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:11:26,727 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-12 17:11:26,727 INFO L430 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:11:26,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:11:26,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1621222325, now seen corresponding path program 2 times [2021-08-12 17:11:26,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:11:26,727 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778834348] [2021-08-12 17:11:26,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:11:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 17:11:26,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-12 17:11:26,841 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 17:11:26,841 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778834348] [2021-08-12 17:11:26,841 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778834348] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 17:11:26,841 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 17:11:26,841 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-12 17:11:26,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057104971] [2021-08-12 17:11:26,841 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-12 17:11:26,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 17:11:26,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-12 17:11:26,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-12 17:11:26,842 INFO L87 Difference]: Start difference. First operand 3644 states and 13389 transitions. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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-08-12 17:11:27,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-12 17:11:27,209 INFO L93 Difference]: Finished difference Result 5576 states and 20521 transitions. [2021-08-12 17:11:27,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 17:11:27,210 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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 95 [2021-08-12 17:11:27,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-12 17:11:27,356 INFO L225 Difference]: With dead ends: 5576 [2021-08-12 17:11:27,356 INFO L226 Difference]: Without dead ends: 2636 [2021-08-12 17:11:27,360 INFO L806 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 91.9ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-08-12 17:11:27,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2021-08-12 17:11:27,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2636. [2021-08-12 17:11:27,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2636 states, 2635 states have (on average 3.541935483870968) internal successors, (9333), 2635 states have internal predecessors, (9333), 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-08-12 17:11:27,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 9333 transitions. [2021-08-12 17:11:27,576 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 9333 transitions. Word has length 95 [2021-08-12 17:11:27,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-12 17:11:27,577 INFO L482 AbstractCegarLoop]: Abstraction has 2636 states and 9333 transitions. [2021-08-12 17:11:27,577 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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-08-12 17:11:27,577 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 9333 transitions. [2021-08-12 17:11:27,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-08-12 17:11:27,581 INFO L542 BasicCegarLoop]: Found error trace [2021-08-12 17:11:27,581 INFO L550 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 17:11:27,581 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-12 17:11:27,581 INFO L430 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 17:11:27,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 17:11:27,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1807411347, now seen corresponding path program 3 times [2021-08-12 17:11:27,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 17:11:27,582 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609058857] [2021-08-12 17:11:27,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 17:11:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-12 17:11:27,606 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-12 17:11:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-12 17:11:27,632 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-12 17:11:27,675 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-12 17:11:27,675 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-12 17:11:27,676 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-12 17:11:27,679 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-12 17:11:27,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.08 05:11:27 BasicIcfg [2021-08-12 17:11:27,791 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-12 17:11:27,791 INFO L168 Benchmark]: Toolchain (without parser) took 87612.47 ms. Allocated memory was 209.7 MB in the beginning and 8.0 GB in the end (delta: 7.8 GB). Free memory was 172.5 MB in the beginning and 6.0 GB in the end (delta: -5.8 GB). Peak memory consumption was 2.0 GB. Max. memory is 8.0 GB. [2021-08-12 17:11:27,792 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 209.7 MB. Free memory is still 191.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-12 17:11:27,792 INFO L168 Benchmark]: CACSL2BoogieTranslator took 462.37 ms. Allocated memory is still 209.7 MB. Free memory was 172.3 MB in the beginning and 167.2 MB in the end (delta: 5.0 MB). Peak memory consumption was 15.3 MB. Max. memory is 8.0 GB. [2021-08-12 17:11:27,792 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.77 ms. Allocated memory is still 209.7 MB. Free memory was 167.2 MB in the beginning and 164.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-12 17:11:27,793 INFO L168 Benchmark]: Boogie Preprocessor took 23.87 ms. Allocated memory is still 209.7 MB. Free memory was 164.2 MB in the beginning and 162.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-12 17:11:27,793 INFO L168 Benchmark]: RCFGBuilder took 1461.79 ms. Allocated memory is still 209.7 MB. Free memory was 162.1 MB in the beginning and 181.5 MB in the end (delta: -19.4 MB). Peak memory consumption was 100.3 MB. Max. memory is 8.0 GB. [2021-08-12 17:11:27,793 INFO L168 Benchmark]: TraceAbstraction took 85618.66 ms. Allocated memory was 209.7 MB in the beginning and 8.0 GB in the end (delta: 7.8 GB). Free memory was 180.9 MB in the beginning and 6.0 GB in the end (delta: -5.8 GB). Peak memory consumption was 2.0 GB. Max. memory is 8.0 GB. [2021-08-12 17:11:27,793 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.13 ms. Allocated memory is still 209.7 MB. Free memory is still 191.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 462.37 ms. Allocated memory is still 209.7 MB. Free memory was 172.3 MB in the beginning and 167.2 MB in the end (delta: 5.0 MB). Peak memory consumption was 15.3 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 39.77 ms. Allocated memory is still 209.7 MB. Free memory was 167.2 MB in the beginning and 164.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 23.87 ms. Allocated memory is still 209.7 MB. Free memory was 164.2 MB in the beginning and 162.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1461.79 ms. Allocated memory is still 209.7 MB. Free memory was 162.1 MB in the beginning and 181.5 MB in the end (delta: -19.4 MB). Peak memory consumption was 100.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 85618.66 ms. Allocated memory was 209.7 MB in the beginning and 8.0 GB in the end (delta: 7.8 GB). Free memory was 180.9 MB in the beginning and 6.0 GB in the end (delta: -5.8 GB). Peak memory consumption was 2.0 GB. Max. memory is 8.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: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0] [L714] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0] [L715] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0] [L716] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L718] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L720] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L722] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L723] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L724] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L725] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L726] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L727] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L728] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L729] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L730] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L731] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L732] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L733] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L734] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L735] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L736] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L737] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L738] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L739] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L740] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L742] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 pthread_t t1525; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1525, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t1526; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1526, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1527; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1527, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0: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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1528; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0: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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] FCALL, FORK 0 pthread_create(&t1528, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0: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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0: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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0: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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 y = 2 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L786] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L860] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L861] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L861] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L862] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, 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, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 158 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 85409.3ms, OverallIterations: 18, TraceHistogramMax: 1, EmptinessCheckTime: 1504.1ms, AutomataDifference: 35051.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 19873.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2848 SDtfs, 4579 SDslu, 10743 SDs, 0 SdLazy, 1089 SolverSat, 253 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 956.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 2019.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=105490occurred in iteration=0, InterpolantAutomatonStates: 180, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 23874.6ms AutomataMinimizationTime, 17 MinimizatonAttempts, 18430 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 58.9ms SsaConstructionTime, 494.9ms SatisfiabilityAnalysisTime, 1839.2ms InterpolantComputationTime, 1523 NumberOfCodeBlocks, 1523 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1411 ConstructedInterpolants, 0 QuantifiedInterpolants, 6739 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...