/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/safe032_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-a47a088281b0b97d17910950432b7c5b5bc3adeb-a47a088 [2021-07-13 18:54:38,318 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-13 18:54:38,319 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-13 18:54:38,347 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-13 18:54:38,348 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-13 18:54:38,348 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-13 18:54:38,349 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-13 18:54:38,365 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-13 18:54:38,367 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-13 18:54:38,367 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-13 18:54:38,368 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-13 18:54:38,369 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-13 18:54:38,369 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-13 18:54:38,369 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-13 18:54:38,370 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-13 18:54:38,371 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-13 18:54:38,371 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-13 18:54:38,381 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-13 18:54:38,382 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-13 18:54:38,383 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-13 18:54:38,384 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-13 18:54:38,385 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-13 18:54:38,385 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-13 18:54:38,386 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-13 18:54:38,395 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-13 18:54:38,395 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-13 18:54:38,395 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-13 18:54:38,396 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-13 18:54:38,396 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-13 18:54:38,397 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-13 18:54:38,397 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-13 18:54:38,397 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-13 18:54:38,398 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-13 18:54:38,398 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-13 18:54:38,399 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-13 18:54:38,399 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-13 18:54:38,400 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-13 18:54:38,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-13 18:54:38,400 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-13 18:54:38,401 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-13 18:54:38,401 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-13 18:54:38,417 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-07-13 18:54:38,432 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-13 18:54:38,432 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-13 18:54:38,432 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-07-13 18:54:38,432 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-07-13 18:54:38,433 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-13 18:54:38,433 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-13 18:54:38,433 INFO L138 SettingsManager]: * Use SBE=true [2021-07-13 18:54:38,434 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-13 18:54:38,434 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-13 18:54:38,434 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-13 18:54:38,434 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-13 18:54:38,434 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-13 18:54:38,434 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-13 18:54:38,434 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-13 18:54:38,434 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-13 18:54:38,434 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-13 18:54:38,434 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-13 18:54:38,434 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-13 18:54:38,435 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-13 18:54:38,435 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-13 18:54:38,435 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-13 18:54:38,435 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-07-13 18:54:38,435 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-13 18:54:38,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-13 18:54:38,435 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-13 18:54:38,435 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-13 18:54:38,435 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-13 18:54:38,436 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-13 18:54:38,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-13 18:54:38,436 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-07-13 18:54:38,436 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-13 18:54:38,436 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-07-13 18:54:38,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-13 18:54:38,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-13 18:54:38,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-13 18:54:38,743 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-13 18:54:38,743 INFO L275 PluginConnector]: CDTParser initialized [2021-07-13 18:54:38,744 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_pso.oepc.i [2021-07-13 18:54:38,801 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/506fba6e0/bed6e376a3fd4b0b871ce63d5f162848/FLAG0c45a4fed [2021-07-13 18:54:39,240 INFO L306 CDTParser]: Found 1 translation units. [2021-07-13 18:54:39,240 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_pso.oepc.i [2021-07-13 18:54:39,257 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/506fba6e0/bed6e376a3fd4b0b871ce63d5f162848/FLAG0c45a4fed [2021-07-13 18:54:39,561 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/506fba6e0/bed6e376a3fd4b0b871ce63d5f162848 [2021-07-13 18:54:39,562 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-13 18:54:39,563 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-07-13 18:54:39,567 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-13 18:54:39,568 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-13 18:54:39,571 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-13 18:54:39,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:54:39" (1/1) ... [2021-07-13 18:54:39,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58e5a42d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:54:39, skipping insertion in model container [2021-07-13 18:54:39,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:54:39" (1/1) ... [2021-07-13 18:54:39,579 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-13 18:54:39,628 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-13 18:54:39,738 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/safe032_pso.oepc.i[993,1006] [2021-07-13 18:54:39,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-13 18:54:39,954 INFO L203 MainTranslator]: Completed pre-run [2021-07-13 18:54:39,964 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/safe032_pso.oepc.i[993,1006] [2021-07-13 18:54:40,007 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-13 18:54:40,037 INFO L208 MainTranslator]: Completed translation [2021-07-13 18:54:40,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:54:40 WrapperNode [2021-07-13 18:54:40,038 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-13 18:54:40,039 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-13 18:54:40,039 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-13 18:54:40,039 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-13 18:54:40,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:54:40" (1/1) ... [2021-07-13 18:54:40,059 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:54:40" (1/1) ... [2021-07-13 18:54:40,083 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-13 18:54:40,084 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-13 18:54:40,084 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-13 18:54:40,084 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-13 18:54:40,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:54:40" (1/1) ... [2021-07-13 18:54:40,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:54:40" (1/1) ... [2021-07-13 18:54:40,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:54:40" (1/1) ... [2021-07-13 18:54:40,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:54:40" (1/1) ... [2021-07-13 18:54:40,121 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:54:40" (1/1) ... [2021-07-13 18:54:40,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:54:40" (1/1) ... [2021-07-13 18:54:40,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:54:40" (1/1) ... [2021-07-13 18:54:40,132 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-13 18:54:40,133 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-13 18:54:40,133 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-13 18:54:40,133 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-13 18:54:40,134 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:54:40" (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-07-13 18:54:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-07-13 18:54:40,208 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-07-13 18:54:40,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-13 18:54:40,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-13 18:54:40,208 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-07-13 18:54:40,209 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-07-13 18:54:40,210 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-07-13 18:54:40,210 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-07-13 18:54:40,210 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-07-13 18:54:40,210 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-07-13 18:54:40,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-13 18:54:40,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-07-13 18:54:40,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-13 18:54:40,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-13 18:54:40,212 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-07-13 18:54:42,794 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-13 18:54:42,794 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-07-13 18:54:42,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:54:42 BoogieIcfgContainer [2021-07-13 18:54:42,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-13 18:54:42,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-13 18:54:42,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-13 18:54:42,798 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-13 18:54:42,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 06:54:39" (1/3) ... [2021-07-13 18:54:42,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269e13da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:54:42, skipping insertion in model container [2021-07-13 18:54:42,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:54:40" (2/3) ... [2021-07-13 18:54:42,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269e13da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:54:42, skipping insertion in model container [2021-07-13 18:54:42,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:54:42" (3/3) ... [2021-07-13 18:54:42,800 INFO L111 eAbstractionObserver]: Analyzing ICFG safe032_pso.oepc.i [2021-07-13 18:54:42,816 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-07-13 18:54:42,816 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-13 18:54:42,816 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-07-13 18:54:42,816 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-07-13 18:54:42,848 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,848 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,848 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,848 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,848 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,848 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,848 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,848 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,849 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,849 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,849 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,849 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,849 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,849 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,849 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,849 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,849 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,849 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,849 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,849 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,849 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,849 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,851 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,851 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,851 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,851 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,851 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,851 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,851 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,851 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,851 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,851 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,852 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,852 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,852 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,852 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,856 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,856 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,856 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,856 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,856 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,857 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,857 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,857 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,859 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,859 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,859 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,859 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,859 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,859 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,859 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,859 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,859 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,859 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,859 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,859 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,859 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,862 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,862 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,862 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,868 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,868 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,868 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,868 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,868 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,868 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,869 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,869 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,871 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,871 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,874 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,875 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,875 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,875 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,877 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,877 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,877 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,877 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,877 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,883 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,883 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,883 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,883 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,883 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,884 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,884 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,886 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,886 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,887 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,887 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,887 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,887 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,887 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,887 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,888 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,888 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,888 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,888 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,888 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,888 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,888 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,888 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,888 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,889 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,889 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,889 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,889 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,892 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,894 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,894 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,894 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,894 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,894 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,894 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,895 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,895 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,895 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:54:42,896 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-07-13 18:54:42,918 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-13 18:54:42,941 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-13 18:54:42,942 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-13 18:54:42,942 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-13 18:54:42,942 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-13 18:54:42,942 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-13 18:54:42,942 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-13 18:54:42,942 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-13 18:54:42,942 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P2Thread1of1ForFork0======== [2021-07-13 18:54:42,956 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 114 places, 106 transitions, 227 flow [2021-07-13 18:54:43,112 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5632 states, 5630 states have (on average 3.3650088809946714) internal successors, (18945), 5631 states have internal predecessors, (18945), 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-07-13 18:54:43,132 INFO L276 IsEmpty]: Start isEmpty. Operand has 5632 states, 5630 states have (on average 3.3650088809946714) internal successors, (18945), 5631 states have internal predecessors, (18945), 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-07-13 18:54:43,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-07-13 18:54:43,142 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:43,143 INFO L508 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] [2021-07-13 18:54:43,143 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:43,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:43,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1914108186, now seen corresponding path program 1 times [2021-07-13 18:54:43,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:43,154 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827085898] [2021-07-13 18:54:43,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:43,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:43,368 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:43,368 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827085898] [2021-07-13 18:54:43,397 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827085898] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:43,397 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:43,397 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-13 18:54:43,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554787917] [2021-07-13 18:54:43,411 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-13 18:54:43,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:43,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-13 18:54:43,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-13 18:54:43,440 INFO L87 Difference]: Start difference. First operand has 5632 states, 5630 states have (on average 3.3650088809946714) internal successors, (18945), 5631 states have internal predecessors, (18945), 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 27.5) internal successors, (55), 3 states have internal predecessors, (55), 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-07-13 18:54:43,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:43,523 INFO L93 Difference]: Finished difference Result 3805 states and 11849 transitions. [2021-07-13 18:54:43,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-13 18:54:43,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 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 55 [2021-07-13 18:54:43,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:43,533 INFO L225 Difference]: With dead ends: 3805 [2021-07-13 18:54:43,536 INFO L226 Difference]: Without dead ends: 0 [2021-07-13 18:54:43,537 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-13 18:54:43,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-13 18:54:43,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-13 18:54:43,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-07-13 18:54:43,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-13 18:54:43,552 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2021-07-13 18:54:43,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:43,552 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-13 18:54:43,552 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 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-07-13 18:54:43,553 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-13 18:54:43,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-13 18:54:43,553 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-13 18:54:43,553 INFO L301 ceAbstractionStarter]: Result for error location P2Thread1of1ForFork0 was SAFE (1/2) [2021-07-13 18:54:43,555 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-07-13 18:54:43,556 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-13 18:54:43,556 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-13 18:54:43,556 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-13 18:54:43,556 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-13 18:54:43,556 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-13 18:54:43,556 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-13 18:54:43,556 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-13 18:54:43,556 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-07-13 18:54:43,558 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 114 places, 106 transitions, 227 flow [2021-07-13 18:54:43,848 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 9601 states, 9599 states have (on average 3.5750599020731326) internal successors, (34317), 9600 states have internal predecessors, (34317), 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-07-13 18:54:43,883 INFO L276 IsEmpty]: Start isEmpty. Operand has 9601 states, 9599 states have (on average 3.5750599020731326) internal successors, (34317), 9600 states have internal predecessors, (34317), 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-07-13 18:54:43,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-07-13 18:54:43,905 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:43,906 INFO L508 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] [2021-07-13 18:54:43,906 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:43,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:43,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1969788092, now seen corresponding path program 1 times [2021-07-13 18:54:43,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:43,907 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155811873] [2021-07-13 18:54:43,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:44,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:44,116 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:44,116 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155811873] [2021-07-13 18:54:44,117 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155811873] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:44,117 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:44,117 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-13 18:54:44,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351913838] [2021-07-13 18:54:44,117 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-13 18:54:44,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:44,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-13 18:54:44,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-13 18:54:44,159 INFO L87 Difference]: Start difference. First operand has 9601 states, 9599 states have (on average 3.5750599020731326) internal successors, (34317), 9600 states have internal predecessors, (34317), 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 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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-07-13 18:54:44,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:44,440 INFO L93 Difference]: Finished difference Result 10357 states and 36015 transitions. [2021-07-13 18:54:44,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-13 18:54:44,441 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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 67 [2021-07-13 18:54:44,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:44,489 INFO L225 Difference]: With dead ends: 10357 [2021-07-13 18:54:44,489 INFO L226 Difference]: Without dead ends: 7522 [2021-07-13 18:54:44,489 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 98.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-13 18:54:44,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7522 states. [2021-07-13 18:54:44,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7522 to 7522. [2021-07-13 18:54:44,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7522 states, 7520 states have (on average 3.460771276595745) internal successors, (26025), 7521 states have internal predecessors, (26025), 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-07-13 18:54:44,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7522 states to 7522 states and 26025 transitions. [2021-07-13 18:54:44,826 INFO L78 Accepts]: Start accepts. Automaton has 7522 states and 26025 transitions. Word has length 67 [2021-07-13 18:54:44,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:44,828 INFO L482 AbstractCegarLoop]: Abstraction has 7522 states and 26025 transitions. [2021-07-13 18:54:44,828 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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-07-13 18:54:44,828 INFO L276 IsEmpty]: Start isEmpty. Operand 7522 states and 26025 transitions. [2021-07-13 18:54:44,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-07-13 18:54:44,842 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:44,842 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 18:54:44,842 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-13 18:54:44,842 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:44,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:44,845 INFO L82 PathProgramCache]: Analyzing trace with hash -175824292, now seen corresponding path program 1 times [2021-07-13 18:54:44,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:44,845 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108587873] [2021-07-13 18:54:44,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:45,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:45,165 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:45,165 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108587873] [2021-07-13 18:54:45,165 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108587873] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:45,165 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:45,165 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-13 18:54:45,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783704500] [2021-07-13 18:54:45,166 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-13 18:54:45,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:45,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-13 18:54:45,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-13 18:54:45,167 INFO L87 Difference]: Start difference. First operand 7522 states and 26025 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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-07-13 18:54:45,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:45,339 INFO L93 Difference]: Finished difference Result 8542 states and 29306 transitions. [2021-07-13 18:54:45,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-13 18:54:45,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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 71 [2021-07-13 18:54:45,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:45,391 INFO L225 Difference]: With dead ends: 8542 [2021-07-13 18:54:45,392 INFO L226 Difference]: Without dead ends: 7282 [2021-07-13 18:54:45,392 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 119.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-13 18:54:45,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7282 states. [2021-07-13 18:54:45,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7282 to 7282. [2021-07-13 18:54:45,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7282 states, 7280 states have (on average 3.449587912087912) internal successors, (25113), 7281 states have internal predecessors, (25113), 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-07-13 18:54:45,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7282 states to 7282 states and 25113 transitions. [2021-07-13 18:54:45,659 INFO L78 Accepts]: Start accepts. Automaton has 7282 states and 25113 transitions. Word has length 71 [2021-07-13 18:54:45,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:45,660 INFO L482 AbstractCegarLoop]: Abstraction has 7282 states and 25113 transitions. [2021-07-13 18:54:45,660 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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-07-13 18:54:45,660 INFO L276 IsEmpty]: Start isEmpty. Operand 7282 states and 25113 transitions. [2021-07-13 18:54:45,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-07-13 18:54:45,678 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:45,678 INFO L508 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] [2021-07-13 18:54:45,679 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-07-13 18:54:45,679 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:45,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:45,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1596498909, now seen corresponding path program 1 times [2021-07-13 18:54:45,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:45,680 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857138300] [2021-07-13 18:54:45,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:46,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:46,092 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:46,093 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857138300] [2021-07-13 18:54:46,093 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857138300] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:46,093 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:46,093 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-13 18:54:46,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465690326] [2021-07-13 18:54:46,098 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-13 18:54:46,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:46,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-13 18:54:46,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-07-13 18:54:46,100 INFO L87 Difference]: Start difference. First operand 7282 states and 25113 transitions. Second operand has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 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-07-13 18:54:46,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:46,621 INFO L93 Difference]: Finished difference Result 8569 states and 29393 transitions. [2021-07-13 18:54:46,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-07-13 18:54:46,622 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 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 73 [2021-07-13 18:54:46,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:46,653 INFO L225 Difference]: With dead ends: 8569 [2021-07-13 18:54:46,653 INFO L226 Difference]: Without dead ends: 7345 [2021-07-13 18:54:46,653 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 326.2ms TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2021-07-13 18:54:46,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7345 states. [2021-07-13 18:54:46,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7345 to 6895. [2021-07-13 18:54:46,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6895 states, 6894 states have (on average 3.432840150855817) internal successors, (23666), 6894 states have internal predecessors, (23666), 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-07-13 18:54:46,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6895 states to 6895 states and 23666 transitions. [2021-07-13 18:54:46,889 INFO L78 Accepts]: Start accepts. Automaton has 6895 states and 23666 transitions. Word has length 73 [2021-07-13 18:54:46,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:46,889 INFO L482 AbstractCegarLoop]: Abstraction has 6895 states and 23666 transitions. [2021-07-13 18:54:46,889 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 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-07-13 18:54:46,890 INFO L276 IsEmpty]: Start isEmpty. Operand 6895 states and 23666 transitions. [2021-07-13 18:54:46,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-07-13 18:54:46,906 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:46,907 INFO L508 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] [2021-07-13 18:54:46,907 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-07-13 18:54:46,907 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:46,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:46,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1326386689, now seen corresponding path program 1 times [2021-07-13 18:54:46,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:46,908 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143305055] [2021-07-13 18:54:46,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:47,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:47,014 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:47,014 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143305055] [2021-07-13 18:54:47,014 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143305055] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:47,014 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:47,014 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-13 18:54:47,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399666507] [2021-07-13 18:54:47,015 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-13 18:54:47,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:47,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-13 18:54:47,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-13 18:54:47,016 INFO L87 Difference]: Start difference. First operand 6895 states and 23666 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-07-13 18:54:47,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:47,216 INFO L93 Difference]: Finished difference Result 10615 states and 36012 transitions. [2021-07-13 18:54:47,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-13 18:54:47,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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 74 [2021-07-13 18:54:47,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:47,249 INFO L225 Difference]: With dead ends: 10615 [2021-07-13 18:54:47,249 INFO L226 Difference]: Without dead ends: 6621 [2021-07-13 18:54:47,249 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 84.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-13 18:54:47,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6621 states. [2021-07-13 18:54:47,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6621 to 5871. [2021-07-13 18:54:47,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5871 states, 5870 states have (on average 3.3282793867120954) internal successors, (19537), 5870 states have internal predecessors, (19537), 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-07-13 18:54:47,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5871 states to 5871 states and 19537 transitions. [2021-07-13 18:54:47,459 INFO L78 Accepts]: Start accepts. Automaton has 5871 states and 19537 transitions. Word has length 74 [2021-07-13 18:54:47,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:47,459 INFO L482 AbstractCegarLoop]: Abstraction has 5871 states and 19537 transitions. [2021-07-13 18:54:47,459 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-07-13 18:54:47,460 INFO L276 IsEmpty]: Start isEmpty. Operand 5871 states and 19537 transitions. [2021-07-13 18:54:47,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-07-13 18:54:47,475 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:47,475 INFO L508 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] [2021-07-13 18:54:47,475 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-07-13 18:54:47,475 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:47,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:47,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1145074345, now seen corresponding path program 1 times [2021-07-13 18:54:47,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:47,476 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283547776] [2021-07-13 18:54:47,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:47,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:47,728 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:47,728 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283547776] [2021-07-13 18:54:47,728 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283547776] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:47,728 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:47,728 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-13 18:54:47,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033747905] [2021-07-13 18:54:47,729 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-13 18:54:47,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:47,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-13 18:54:47,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-07-13 18:54:47,730 INFO L87 Difference]: Start difference. First operand 5871 states and 19537 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 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-07-13 18:54:48,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:48,127 INFO L93 Difference]: Finished difference Result 7103 states and 23577 transitions. [2021-07-13 18:54:48,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-07-13 18:54:48,128 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 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 75 [2021-07-13 18:54:48,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:48,146 INFO L225 Difference]: With dead ends: 7103 [2021-07-13 18:54:48,146 INFO L226 Difference]: Without dead ends: 6471 [2021-07-13 18:54:48,146 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 229.9ms TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-07-13 18:54:48,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6471 states. [2021-07-13 18:54:48,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6471 to 5961. [2021-07-13 18:54:48,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5961 states, 5960 states have (on average 3.3276845637583894) internal successors, (19833), 5960 states have internal predecessors, (19833), 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-07-13 18:54:48,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5961 states to 5961 states and 19833 transitions. [2021-07-13 18:54:48,300 INFO L78 Accepts]: Start accepts. Automaton has 5961 states and 19833 transitions. Word has length 75 [2021-07-13 18:54:48,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:48,300 INFO L482 AbstractCegarLoop]: Abstraction has 5961 states and 19833 transitions. [2021-07-13 18:54:48,301 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 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-07-13 18:54:48,301 INFO L276 IsEmpty]: Start isEmpty. Operand 5961 states and 19833 transitions. [2021-07-13 18:54:48,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-07-13 18:54:48,312 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:48,313 INFO L508 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] [2021-07-13 18:54:48,313 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-07-13 18:54:48,313 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:48,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:48,313 INFO L82 PathProgramCache]: Analyzing trace with hash -477292069, now seen corresponding path program 2 times [2021-07-13 18:54:48,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:48,314 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753558765] [2021-07-13 18:54:48,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:48,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:48,577 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:48,578 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753558765] [2021-07-13 18:54:48,578 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753558765] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:48,578 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:48,578 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-13 18:54:48,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178806244] [2021-07-13 18:54:48,578 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-13 18:54:48,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:48,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-13 18:54:48,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-07-13 18:54:48,579 INFO L87 Difference]: Start difference. First operand 5961 states and 19833 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 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-07-13 18:54:48,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:48,954 INFO L93 Difference]: Finished difference Result 7365 states and 24323 transitions. [2021-07-13 18:54:48,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-13 18:54:48,954 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 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 75 [2021-07-13 18:54:48,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:48,972 INFO L225 Difference]: With dead ends: 7365 [2021-07-13 18:54:48,973 INFO L226 Difference]: Without dead ends: 6353 [2021-07-13 18:54:48,973 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 241.2ms TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2021-07-13 18:54:48,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6353 states. [2021-07-13 18:54:49,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6353 to 6137. [2021-07-13 18:54:49,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6137 states, 6136 states have (on average 3.33116036505867) internal successors, (20440), 6136 states have internal predecessors, (20440), 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-07-13 18:54:49,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6137 states to 6137 states and 20440 transitions. [2021-07-13 18:54:49,129 INFO L78 Accepts]: Start accepts. Automaton has 6137 states and 20440 transitions. Word has length 75 [2021-07-13 18:54:49,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:49,130 INFO L482 AbstractCegarLoop]: Abstraction has 6137 states and 20440 transitions. [2021-07-13 18:54:49,130 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 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-07-13 18:54:49,130 INFO L276 IsEmpty]: Start isEmpty. Operand 6137 states and 20440 transitions. [2021-07-13 18:54:49,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-07-13 18:54:49,144 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:49,144 INFO L508 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] [2021-07-13 18:54:49,145 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-13 18:54:49,145 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:49,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:49,146 INFO L82 PathProgramCache]: Analyzing trace with hash -2066143879, now seen corresponding path program 3 times [2021-07-13 18:54:49,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:49,146 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006798007] [2021-07-13 18:54:49,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:49,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:49,376 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:49,379 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006798007] [2021-07-13 18:54:49,379 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006798007] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:49,379 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:49,379 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-07-13 18:54:49,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129377908] [2021-07-13 18:54:49,380 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-07-13 18:54:49,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:49,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-07-13 18:54:49,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-07-13 18:54:49,380 INFO L87 Difference]: Start difference. First operand 6137 states and 20440 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 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-07-13 18:54:49,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:49,694 INFO L93 Difference]: Finished difference Result 7561 states and 24786 transitions. [2021-07-13 18:54:49,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-13 18:54:49,694 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 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 75 [2021-07-13 18:54:49,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:49,712 INFO L225 Difference]: With dead ends: 7561 [2021-07-13 18:54:49,712 INFO L226 Difference]: Without dead ends: 6893 [2021-07-13 18:54:49,712 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 198.2ms TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2021-07-13 18:54:49,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6893 states. [2021-07-13 18:54:49,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6893 to 6413. [2021-07-13 18:54:49,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6413 states, 6412 states have (on average 3.3117592014971926) internal successors, (21235), 6412 states have internal predecessors, (21235), 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-07-13 18:54:49,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6413 states to 6413 states and 21235 transitions. [2021-07-13 18:54:49,845 INFO L78 Accepts]: Start accepts. Automaton has 6413 states and 21235 transitions. Word has length 75 [2021-07-13 18:54:49,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:49,845 INFO L482 AbstractCegarLoop]: Abstraction has 6413 states and 21235 transitions. [2021-07-13 18:54:49,845 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 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-07-13 18:54:49,846 INFO L276 IsEmpty]: Start isEmpty. Operand 6413 states and 21235 transitions. [2021-07-13 18:54:49,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-07-13 18:54:49,857 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:49,857 INFO L508 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] [2021-07-13 18:54:49,857 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-07-13 18:54:49,857 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:49,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:49,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1477414137, now seen corresponding path program 4 times [2021-07-13 18:54:49,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:49,858 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275316487] [2021-07-13 18:54:49,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:50,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:50,056 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:50,056 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275316487] [2021-07-13 18:54:50,056 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275316487] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:50,056 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:50,056 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-13 18:54:50,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795005994] [2021-07-13 18:54:50,057 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-13 18:54:50,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:50,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-13 18:54:50,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-07-13 18:54:50,057 INFO L87 Difference]: Start difference. First operand 6413 states and 21235 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 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-07-13 18:54:50,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:50,436 INFO L93 Difference]: Finished difference Result 10045 states and 33190 transitions. [2021-07-13 18:54:50,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-13 18:54:50,437 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 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 75 [2021-07-13 18:54:50,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:50,456 INFO L225 Difference]: With dead ends: 10045 [2021-07-13 18:54:50,456 INFO L226 Difference]: Without dead ends: 7249 [2021-07-13 18:54:50,457 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 217.4ms TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2021-07-13 18:54:50,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7249 states. [2021-07-13 18:54:50,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7249 to 6871. [2021-07-13 18:54:50,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6871 states, 6870 states have (on average 3.2983988355167395) internal successors, (22660), 6870 states have internal predecessors, (22660), 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-07-13 18:54:50,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6871 states to 6871 states and 22660 transitions. [2021-07-13 18:54:50,635 INFO L78 Accepts]: Start accepts. Automaton has 6871 states and 22660 transitions. Word has length 75 [2021-07-13 18:54:50,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:50,635 INFO L482 AbstractCegarLoop]: Abstraction has 6871 states and 22660 transitions. [2021-07-13 18:54:50,635 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 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-07-13 18:54:50,636 INFO L276 IsEmpty]: Start isEmpty. Operand 6871 states and 22660 transitions. [2021-07-13 18:54:50,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-13 18:54:50,647 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:50,647 INFO L508 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] [2021-07-13 18:54:50,647 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-07-13 18:54:50,648 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:50,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:50,648 INFO L82 PathProgramCache]: Analyzing trace with hash -2032246241, now seen corresponding path program 1 times [2021-07-13 18:54:50,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:50,648 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836746045] [2021-07-13 18:54:50,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:51,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:51,006 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:51,007 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836746045] [2021-07-13 18:54:51,007 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836746045] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:51,007 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:51,007 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-07-13 18:54:51,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741206758] [2021-07-13 18:54:51,007 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-07-13 18:54:51,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:51,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-07-13 18:54:51,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2021-07-13 18:54:51,008 INFO L87 Difference]: Start difference. First operand 6871 states and 22660 transitions. Second operand has 17 states, 17 states have (on average 4.470588235294118) internal successors, (76), 17 states have internal predecessors, (76), 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-07-13 18:54:51,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:51,533 INFO L93 Difference]: Finished difference Result 8061 states and 26466 transitions. [2021-07-13 18:54:51,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-07-13 18:54:51,533 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.470588235294118) internal successors, (76), 17 states have internal predecessors, (76), 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 76 [2021-07-13 18:54:51,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:51,546 INFO L225 Difference]: With dead ends: 8061 [2021-07-13 18:54:51,546 INFO L226 Difference]: Without dead ends: 6333 [2021-07-13 18:54:51,546 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 401.9ms TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2021-07-13 18:54:51,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6333 states. [2021-07-13 18:54:51,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6333 to 5625. [2021-07-13 18:54:51,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5625 states, 5624 states have (on average 3.3220128022759603) internal successors, (18683), 5624 states have internal predecessors, (18683), 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-07-13 18:54:51,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5625 states to 5625 states and 18683 transitions. [2021-07-13 18:54:51,643 INFO L78 Accepts]: Start accepts. Automaton has 5625 states and 18683 transitions. Word has length 76 [2021-07-13 18:54:51,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:51,643 INFO L482 AbstractCegarLoop]: Abstraction has 5625 states and 18683 transitions. [2021-07-13 18:54:51,643 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 4.470588235294118) internal successors, (76), 17 states have internal predecessors, (76), 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-07-13 18:54:51,643 INFO L276 IsEmpty]: Start isEmpty. Operand 5625 states and 18683 transitions. [2021-07-13 18:54:51,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-13 18:54:51,652 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:51,652 INFO L508 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] [2021-07-13 18:54:51,652 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-07-13 18:54:51,653 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:51,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:51,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1708555019, now seen corresponding path program 1 times [2021-07-13 18:54:51,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:51,653 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13244238] [2021-07-13 18:54:51,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:51,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:51,808 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:51,808 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13244238] [2021-07-13 18:54:51,808 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13244238] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:51,808 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:51,808 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-07-13 18:54:51,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041855053] [2021-07-13 18:54:51,808 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-07-13 18:54:51,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:51,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-07-13 18:54:51,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-07-13 18:54:51,809 INFO L87 Difference]: Start difference. First operand 5625 states and 18683 transitions. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 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-07-13 18:54:52,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:52,156 INFO L93 Difference]: Finished difference Result 8499 states and 27951 transitions. [2021-07-13 18:54:52,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-13 18:54:52,157 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 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 76 [2021-07-13 18:54:52,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:52,169 INFO L225 Difference]: With dead ends: 8499 [2021-07-13 18:54:52,169 INFO L226 Difference]: Without dead ends: 6055 [2021-07-13 18:54:52,170 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 149.2ms TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2021-07-13 18:54:52,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6055 states. [2021-07-13 18:54:52,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6055 to 6033. [2021-07-13 18:54:52,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6033 states, 6032 states have (on average 3.313163129973475) internal successors, (19985), 6032 states have internal predecessors, (19985), 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-07-13 18:54:52,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6033 states to 6033 states and 19985 transitions. [2021-07-13 18:54:52,276 INFO L78 Accepts]: Start accepts. Automaton has 6033 states and 19985 transitions. Word has length 76 [2021-07-13 18:54:52,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:52,276 INFO L482 AbstractCegarLoop]: Abstraction has 6033 states and 19985 transitions. [2021-07-13 18:54:52,276 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 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-07-13 18:54:52,276 INFO L276 IsEmpty]: Start isEmpty. Operand 6033 states and 19985 transitions. [2021-07-13 18:54:52,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-13 18:54:52,286 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:52,286 INFO L508 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] [2021-07-13 18:54:52,287 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-07-13 18:54:52,287 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:52,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:52,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1122461241, now seen corresponding path program 2 times [2021-07-13 18:54:52,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:52,287 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165296772] [2021-07-13 18:54:52,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:52,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:52,424 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:52,424 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165296772] [2021-07-13 18:54:52,424 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165296772] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:52,424 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:52,424 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-13 18:54:52,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786908622] [2021-07-13 18:54:52,424 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-13 18:54:52,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:52,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-13 18:54:52,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-07-13 18:54:52,425 INFO L87 Difference]: Start difference. First operand 6033 states and 19985 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 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-07-13 18:54:52,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:52,742 INFO L93 Difference]: Finished difference Result 8881 states and 29061 transitions. [2021-07-13 18:54:52,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-13 18:54:52,743 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 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 76 [2021-07-13 18:54:52,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:52,756 INFO L225 Difference]: With dead ends: 8881 [2021-07-13 18:54:52,756 INFO L226 Difference]: Without dead ends: 6630 [2021-07-13 18:54:52,756 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 222.4ms TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2021-07-13 18:54:52,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6630 states. [2021-07-13 18:54:52,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6630 to 5646. [2021-07-13 18:54:52,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5646 states, 5645 states have (on average 3.255093002657219) internal successors, (18375), 5645 states have internal predecessors, (18375), 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-07-13 18:54:52,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5646 states to 5646 states and 18375 transitions. [2021-07-13 18:54:52,860 INFO L78 Accepts]: Start accepts. Automaton has 5646 states and 18375 transitions. Word has length 76 [2021-07-13 18:54:52,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:52,860 INFO L482 AbstractCegarLoop]: Abstraction has 5646 states and 18375 transitions. [2021-07-13 18:54:52,860 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 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-07-13 18:54:52,860 INFO L276 IsEmpty]: Start isEmpty. Operand 5646 states and 18375 transitions. [2021-07-13 18:54:52,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-13 18:54:52,871 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:52,871 INFO L508 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] [2021-07-13 18:54:52,872 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-07-13 18:54:52,872 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:52,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:52,872 INFO L82 PathProgramCache]: Analyzing trace with hash -4204309, now seen corresponding path program 3 times [2021-07-13 18:54:52,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:52,872 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562733212] [2021-07-13 18:54:52,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:52,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:53,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:53,041 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:53,041 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562733212] [2021-07-13 18:54:53,041 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562733212] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:53,041 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:53,041 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-07-13 18:54:53,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844637406] [2021-07-13 18:54:53,042 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-07-13 18:54:53,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:53,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-07-13 18:54:53,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-07-13 18:54:53,043 INFO L87 Difference]: Start difference. First operand 5646 states and 18375 transitions. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 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-07-13 18:54:53,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:53,404 INFO L93 Difference]: Finished difference Result 6386 states and 20619 transitions. [2021-07-13 18:54:53,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-13 18:54:53,405 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 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 76 [2021-07-13 18:54:53,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:53,416 INFO L225 Difference]: With dead ends: 6386 [2021-07-13 18:54:53,416 INFO L226 Difference]: Without dead ends: 5697 [2021-07-13 18:54:53,417 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 163.0ms TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2021-07-13 18:54:53,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5697 states. [2021-07-13 18:54:53,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5697 to 5638. [2021-07-13 18:54:53,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5638 states, 5637 states have (on average 3.255455029270889) internal successors, (18351), 5637 states have internal predecessors, (18351), 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-07-13 18:54:53,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5638 states to 5638 states and 18351 transitions. [2021-07-13 18:54:53,568 INFO L78 Accepts]: Start accepts. Automaton has 5638 states and 18351 transitions. Word has length 76 [2021-07-13 18:54:53,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:53,569 INFO L482 AbstractCegarLoop]: Abstraction has 5638 states and 18351 transitions. [2021-07-13 18:54:53,569 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 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-07-13 18:54:53,569 INFO L276 IsEmpty]: Start isEmpty. Operand 5638 states and 18351 transitions. [2021-07-13 18:54:53,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-13 18:54:53,581 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:53,581 INFO L508 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] [2021-07-13 18:54:53,581 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-07-13 18:54:53,581 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:53,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:53,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1654498663, now seen corresponding path program 4 times [2021-07-13 18:54:53,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:53,582 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197252139] [2021-07-13 18:54:53,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:53,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:53,785 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:53,785 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197252139] [2021-07-13 18:54:53,785 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197252139] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:53,785 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:53,785 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-07-13 18:54:53,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027832455] [2021-07-13 18:54:53,786 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-07-13 18:54:53,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:53,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-07-13 18:54:53,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2021-07-13 18:54:53,786 INFO L87 Difference]: Start difference. First operand 5638 states and 18351 transitions. Second operand has 16 states, 16 states have (on average 4.75) internal successors, (76), 16 states have internal predecessors, (76), 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-07-13 18:54:54,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:54,184 INFO L93 Difference]: Finished difference Result 6356 states and 20534 transitions. [2021-07-13 18:54:54,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-07-13 18:54:54,184 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 16 states have internal predecessors, (76), 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 76 [2021-07-13 18:54:54,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:54,196 INFO L225 Difference]: With dead ends: 6356 [2021-07-13 18:54:54,196 INFO L226 Difference]: Without dead ends: 5650 [2021-07-13 18:54:54,196 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 217.6ms TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2021-07-13 18:54:54,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5650 states. [2021-07-13 18:54:54,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5650 to 5581. [2021-07-13 18:54:54,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5581 states, 5580 states have (on average 3.260215053763441) internal successors, (18192), 5580 states have internal predecessors, (18192), 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-07-13 18:54:54,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5581 states to 5581 states and 18192 transitions. [2021-07-13 18:54:54,304 INFO L78 Accepts]: Start accepts. Automaton has 5581 states and 18192 transitions. Word has length 76 [2021-07-13 18:54:54,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:54,304 INFO L482 AbstractCegarLoop]: Abstraction has 5581 states and 18192 transitions. [2021-07-13 18:54:54,304 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 16 states have internal predecessors, (76), 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-07-13 18:54:54,304 INFO L276 IsEmpty]: Start isEmpty. Operand 5581 states and 18192 transitions. [2021-07-13 18:54:54,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-13 18:54:54,314 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:54,314 INFO L508 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] [2021-07-13 18:54:54,314 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-07-13 18:54:54,314 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:54,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:54,314 INFO L82 PathProgramCache]: Analyzing trace with hash -2064420953, now seen corresponding path program 5 times [2021-07-13 18:54:54,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:54,315 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586373613] [2021-07-13 18:54:54,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:54,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:54,479 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:54,479 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586373613] [2021-07-13 18:54:54,480 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586373613] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:54,480 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:54,480 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-13 18:54:54,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894975834] [2021-07-13 18:54:54,480 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-13 18:54:54,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:54,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-13 18:54:54,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-07-13 18:54:54,481 INFO L87 Difference]: Start difference. First operand 5581 states and 18192 transitions. Second operand has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 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-07-13 18:54:54,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:54,778 INFO L93 Difference]: Finished difference Result 7945 states and 25839 transitions. [2021-07-13 18:54:54,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-13 18:54:54,779 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 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 76 [2021-07-13 18:54:54,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:54,793 INFO L225 Difference]: With dead ends: 7945 [2021-07-13 18:54:54,793 INFO L226 Difference]: Without dead ends: 5878 [2021-07-13 18:54:54,795 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 156.9ms TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2021-07-13 18:54:54,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5878 states. [2021-07-13 18:54:54,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5878 to 5858. [2021-07-13 18:54:54,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5858 states, 5857 states have (on average 3.2627625064025954) internal successors, (19110), 5857 states have internal predecessors, (19110), 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-07-13 18:54:54,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5858 states to 5858 states and 19110 transitions. [2021-07-13 18:54:54,914 INFO L78 Accepts]: Start accepts. Automaton has 5858 states and 19110 transitions. Word has length 76 [2021-07-13 18:54:54,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:54,914 INFO L482 AbstractCegarLoop]: Abstraction has 5858 states and 19110 transitions. [2021-07-13 18:54:54,914 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 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-07-13 18:54:54,914 INFO L276 IsEmpty]: Start isEmpty. Operand 5858 states and 19110 transitions. [2021-07-13 18:54:54,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-13 18:54:54,923 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:54,923 INFO L508 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] [2021-07-13 18:54:54,923 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-07-13 18:54:54,924 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:54,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:54,925 INFO L82 PathProgramCache]: Analyzing trace with hash -777790233, now seen corresponding path program 6 times [2021-07-13 18:54:54,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:54,925 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555383104] [2021-07-13 18:54:54,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:55,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:55,140 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:55,141 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555383104] [2021-07-13 18:54:55,142 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555383104] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:55,142 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:55,142 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-07-13 18:54:55,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877184789] [2021-07-13 18:54:55,143 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-07-13 18:54:55,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:55,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-07-13 18:54:55,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-07-13 18:54:55,144 INFO L87 Difference]: Start difference. First operand 5858 states and 19110 transitions. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 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-07-13 18:54:55,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:55,620 INFO L93 Difference]: Finished difference Result 6564 states and 21262 transitions. [2021-07-13 18:54:55,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-07-13 18:54:55,621 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 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 76 [2021-07-13 18:54:55,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:55,633 INFO L225 Difference]: With dead ends: 6564 [2021-07-13 18:54:55,633 INFO L226 Difference]: Without dead ends: 5889 [2021-07-13 18:54:55,633 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 316.6ms TimeCoverageRelationStatistics Valid=146, Invalid=360, Unknown=0, NotChecked=0, Total=506 [2021-07-13 18:54:55,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5889 states. [2021-07-13 18:54:55,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5889 to 5674. [2021-07-13 18:54:55,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5674 states, 5673 states have (on average 3.261413714084259) internal successors, (18502), 5673 states have internal predecessors, (18502), 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-07-13 18:54:55,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5674 states to 5674 states and 18502 transitions. [2021-07-13 18:54:55,722 INFO L78 Accepts]: Start accepts. Automaton has 5674 states and 18502 transitions. Word has length 76 [2021-07-13 18:54:55,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:55,722 INFO L482 AbstractCegarLoop]: Abstraction has 5674 states and 18502 transitions. [2021-07-13 18:54:55,723 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 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-07-13 18:54:55,723 INFO L276 IsEmpty]: Start isEmpty. Operand 5674 states and 18502 transitions. [2021-07-13 18:54:55,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-13 18:54:55,730 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:55,730 INFO L508 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] [2021-07-13 18:54:55,730 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-07-13 18:54:55,730 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:55,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:55,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1748442281, now seen corresponding path program 7 times [2021-07-13 18:54:55,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:55,731 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696836350] [2021-07-13 18:54:55,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:55,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:55,906 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:55,907 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696836350] [2021-07-13 18:54:55,907 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696836350] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:55,907 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:55,907 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-07-13 18:54:55,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320496793] [2021-07-13 18:54:55,907 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-07-13 18:54:55,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:55,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-07-13 18:54:55,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-07-13 18:54:55,908 INFO L87 Difference]: Start difference. First operand 5674 states and 18502 transitions. Second operand has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 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-07-13 18:54:56,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:56,171 INFO L93 Difference]: Finished difference Result 6549 states and 21214 transitions. [2021-07-13 18:54:56,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-13 18:54:56,172 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 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 76 [2021-07-13 18:54:56,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:56,183 INFO L225 Difference]: With dead ends: 6549 [2021-07-13 18:54:56,184 INFO L226 Difference]: Without dead ends: 5898 [2021-07-13 18:54:56,184 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 156.6ms TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2021-07-13 18:54:56,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5898 states. [2021-07-13 18:54:56,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5898 to 5662. [2021-07-13 18:54:56,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5662 states, 5661 states have (on average 3.2628510863804983) internal successors, (18471), 5661 states have internal predecessors, (18471), 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-07-13 18:54:56,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5662 states to 5662 states and 18471 transitions. [2021-07-13 18:54:56,302 INFO L78 Accepts]: Start accepts. Automaton has 5662 states and 18471 transitions. Word has length 76 [2021-07-13 18:54:56,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:56,303 INFO L482 AbstractCegarLoop]: Abstraction has 5662 states and 18471 transitions. [2021-07-13 18:54:56,303 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 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-07-13 18:54:56,303 INFO L276 IsEmpty]: Start isEmpty. Operand 5662 states and 18471 transitions. [2021-07-13 18:54:56,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-13 18:54:56,311 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:56,311 INFO L508 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] [2021-07-13 18:54:56,311 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-07-13 18:54:56,311 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:56,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:56,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1598070711, now seen corresponding path program 8 times [2021-07-13 18:54:56,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:56,313 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710148118] [2021-07-13 18:54:56,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:56,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:56,502 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:56,502 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710148118] [2021-07-13 18:54:56,502 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710148118] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:56,502 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:56,502 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-13 18:54:56,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933902653] [2021-07-13 18:54:56,503 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-13 18:54:56,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:56,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-13 18:54:56,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-07-13 18:54:56,503 INFO L87 Difference]: Start difference. First operand 5662 states and 18471 transitions. Second operand has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 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-07-13 18:54:56,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:56,916 INFO L93 Difference]: Finished difference Result 8308 states and 26930 transitions. [2021-07-13 18:54:56,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-13 18:54:56,929 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 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 76 [2021-07-13 18:54:56,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:56,942 INFO L225 Difference]: With dead ends: 8308 [2021-07-13 18:54:56,942 INFO L226 Difference]: Without dead ends: 6015 [2021-07-13 18:54:56,943 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 218.2ms TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2021-07-13 18:54:56,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6015 states. [2021-07-13 18:54:57,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6015 to 5688. [2021-07-13 18:54:57,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5688 states, 5687 states have (on average 3.2595393001582558) internal successors, (18537), 5687 states have internal predecessors, (18537), 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-07-13 18:54:57,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5688 states to 5688 states and 18537 transitions. [2021-07-13 18:54:57,038 INFO L78 Accepts]: Start accepts. Automaton has 5688 states and 18537 transitions. Word has length 76 [2021-07-13 18:54:57,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:57,039 INFO L482 AbstractCegarLoop]: Abstraction has 5688 states and 18537 transitions. [2021-07-13 18:54:57,039 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 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-07-13 18:54:57,039 INFO L276 IsEmpty]: Start isEmpty. Operand 5688 states and 18537 transitions. [2021-07-13 18:54:57,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-13 18:54:57,046 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:57,047 INFO L508 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] [2021-07-13 18:54:57,047 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-07-13 18:54:57,047 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:57,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:57,047 INFO L82 PathProgramCache]: Analyzing trace with hash -311439991, now seen corresponding path program 9 times [2021-07-13 18:54:57,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:57,047 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510275552] [2021-07-13 18:54:57,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:57,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:57,221 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:57,222 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510275552] [2021-07-13 18:54:57,222 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510275552] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:57,222 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:57,222 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-07-13 18:54:57,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219702557] [2021-07-13 18:54:57,222 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-13 18:54:57,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:57,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-13 18:54:57,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-07-13 18:54:57,223 INFO L87 Difference]: Start difference. First operand 5688 states and 18537 transitions. Second operand has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 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-07-13 18:54:57,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:57,558 INFO L93 Difference]: Finished difference Result 8316 states and 27004 transitions. [2021-07-13 18:54:57,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-13 18:54:57,558 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 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 76 [2021-07-13 18:54:57,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:57,572 INFO L225 Difference]: With dead ends: 8316 [2021-07-13 18:54:57,572 INFO L226 Difference]: Without dead ends: 5968 [2021-07-13 18:54:57,572 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 240.5ms TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2021-07-13 18:54:57,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2021-07-13 18:54:57,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 5111. [2021-07-13 18:54:57,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5111 states, 5110 states have (on average 3.208219178082192) internal successors, (16394), 5110 states have internal predecessors, (16394), 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-07-13 18:54:57,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5111 states to 5111 states and 16394 transitions. [2021-07-13 18:54:57,665 INFO L78 Accepts]: Start accepts. Automaton has 5111 states and 16394 transitions. Word has length 76 [2021-07-13 18:54:57,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:57,666 INFO L482 AbstractCegarLoop]: Abstraction has 5111 states and 16394 transitions. [2021-07-13 18:54:57,666 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 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-07-13 18:54:57,666 INFO L276 IsEmpty]: Start isEmpty. Operand 5111 states and 16394 transitions. [2021-07-13 18:54:57,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-07-13 18:54:57,673 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:57,674 INFO L508 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-07-13 18:54:57,674 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-07-13 18:54:57,674 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:57,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:57,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1328534623, now seen corresponding path program 1 times [2021-07-13 18:54:57,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:57,674 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817283746] [2021-07-13 18:54:57,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:57,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:57,850 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:57,850 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817283746] [2021-07-13 18:54:57,850 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817283746] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:57,850 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:57,850 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-13 18:54:57,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814964334] [2021-07-13 18:54:57,851 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-13 18:54:57,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:57,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-13 18:54:57,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-07-13 18:54:57,851 INFO L87 Difference]: Start difference. First operand 5111 states and 16394 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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-07-13 18:54:58,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:58,263 INFO L93 Difference]: Finished difference Result 6684 states and 21402 transitions. [2021-07-13 18:54:58,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-07-13 18:54:58,263 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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-07-13 18:54:58,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:58,274 INFO L225 Difference]: With dead ends: 6684 [2021-07-13 18:54:58,274 INFO L226 Difference]: Without dead ends: 5138 [2021-07-13 18:54:58,275 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 224.7ms TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2021-07-13 18:54:58,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5138 states. [2021-07-13 18:54:58,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5138 to 4784. [2021-07-13 18:54:58,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4784 states, 4783 states have (on average 3.2191093455989965) internal successors, (15397), 4783 states have internal predecessors, (15397), 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-07-13 18:54:58,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4784 states to 4784 states and 15397 transitions. [2021-07-13 18:54:58,351 INFO L78 Accepts]: Start accepts. Automaton has 4784 states and 15397 transitions. Word has length 77 [2021-07-13 18:54:58,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:58,351 INFO L482 AbstractCegarLoop]: Abstraction has 4784 states and 15397 transitions. [2021-07-13 18:54:58,351 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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-07-13 18:54:58,351 INFO L276 IsEmpty]: Start isEmpty. Operand 4784 states and 15397 transitions. [2021-07-13 18:54:58,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-07-13 18:54:58,358 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:58,358 INFO L508 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-07-13 18:54:58,358 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-07-13 18:54:58,358 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:58,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:58,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1015156191, now seen corresponding path program 2 times [2021-07-13 18:54:58,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:58,358 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048051053] [2021-07-13 18:54:58,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:58,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:58,626 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:58,626 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048051053] [2021-07-13 18:54:58,626 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048051053] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:58,626 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:58,626 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-07-13 18:54:58,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407683363] [2021-07-13 18:54:58,626 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-07-13 18:54:58,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:58,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-07-13 18:54:58,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2021-07-13 18:54:58,627 INFO L87 Difference]: Start difference. First operand 4784 states and 15397 transitions. Second operand has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 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-07-13 18:54:59,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:59,202 INFO L93 Difference]: Finished difference Result 6086 states and 19497 transitions. [2021-07-13 18:54:59,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-07-13 18:54:59,208 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 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-07-13 18:54:59,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:59,218 INFO L225 Difference]: With dead ends: 6086 [2021-07-13 18:54:59,219 INFO L226 Difference]: Without dead ends: 4794 [2021-07-13 18:54:59,219 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 471.2ms TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2021-07-13 18:54:59,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4794 states. [2021-07-13 18:54:59,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4794 to 4431. [2021-07-13 18:54:59,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4431 states, 4430 states have (on average 3.194130925507901) internal successors, (14150), 4430 states have internal predecessors, (14150), 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-07-13 18:54:59,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4431 states to 4431 states and 14150 transitions. [2021-07-13 18:54:59,285 INFO L78 Accepts]: Start accepts. Automaton has 4431 states and 14150 transitions. Word has length 77 [2021-07-13 18:54:59,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:59,285 INFO L482 AbstractCegarLoop]: Abstraction has 4431 states and 14150 transitions. [2021-07-13 18:54:59,285 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 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-07-13 18:54:59,286 INFO L276 IsEmpty]: Start isEmpty. Operand 4431 states and 14150 transitions. [2021-07-13 18:54:59,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-07-13 18:54:59,292 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:59,292 INFO L508 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-07-13 18:54:59,292 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-07-13 18:54:59,292 INFO L430 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:59,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:59,293 INFO L82 PathProgramCache]: Analyzing trace with hash 80784641, now seen corresponding path program 3 times [2021-07-13 18:54:59,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:59,293 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276311115] [2021-07-13 18:54:59,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:54:59,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:54:59,553 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:54:59,553 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276311115] [2021-07-13 18:54:59,553 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276311115] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:54:59,553 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:54:59,553 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-13 18:54:59,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050043908] [2021-07-13 18:54:59,553 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-13 18:54:59,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:54:59,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-13 18:54:59,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-07-13 18:54:59,554 INFO L87 Difference]: Start difference. First operand 4431 states and 14150 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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-07-13 18:54:59,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:54:59,907 INFO L93 Difference]: Finished difference Result 5963 states and 18903 transitions. [2021-07-13 18:54:59,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-13 18:54:59,908 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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-07-13 18:54:59,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:54:59,915 INFO L225 Difference]: With dead ends: 5963 [2021-07-13 18:54:59,915 INFO L226 Difference]: Without dead ends: 3945 [2021-07-13 18:54:59,916 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 332.6ms TimeCoverageRelationStatistics Valid=126, Invalid=254, Unknown=0, NotChecked=0, Total=380 [2021-07-13 18:54:59,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3945 states. [2021-07-13 18:54:59,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3945 to 3417. [2021-07-13 18:54:59,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3417 states, 3416 states have (on average 3.1358313817330212) internal successors, (10712), 3416 states have internal predecessors, (10712), 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-07-13 18:54:59,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3417 states to 3417 states and 10712 transitions. [2021-07-13 18:54:59,968 INFO L78 Accepts]: Start accepts. Automaton has 3417 states and 10712 transitions. Word has length 77 [2021-07-13 18:54:59,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:54:59,968 INFO L482 AbstractCegarLoop]: Abstraction has 3417 states and 10712 transitions. [2021-07-13 18:54:59,968 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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-07-13 18:54:59,968 INFO L276 IsEmpty]: Start isEmpty. Operand 3417 states and 10712 transitions. [2021-07-13 18:54:59,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-07-13 18:54:59,972 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:54:59,972 INFO L508 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-07-13 18:54:59,973 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-07-13 18:54:59,973 INFO L430 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:54:59,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:54:59,973 INFO L82 PathProgramCache]: Analyzing trace with hash 587070336, now seen corresponding path program 1 times [2021-07-13 18:54:59,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:54:59,973 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458006217] [2021-07-13 18:54:59,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:54:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:55:00,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:55:00,037 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:55:00,037 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458006217] [2021-07-13 18:55:00,037 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458006217] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:55:00,037 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:55:00,037 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-13 18:55:00,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711547773] [2021-07-13 18:55:00,039 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-13 18:55:00,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:55:00,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-13 18:55:00,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-13 18:55:00,039 INFO L87 Difference]: Start difference. First operand 3417 states and 10712 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-07-13 18:55:00,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:55:00,124 INFO L93 Difference]: Finished difference Result 4023 states and 12422 transitions. [2021-07-13 18:55:00,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-13 18:55:00,124 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-07-13 18:55:00,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:55:00,129 INFO L225 Difference]: With dead ends: 4023 [2021-07-13 18:55:00,130 INFO L226 Difference]: Without dead ends: 2855 [2021-07-13 18:55:00,130 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 61.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-13 18:55:00,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2021-07-13 18:55:00,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 2855. [2021-07-13 18:55:00,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2855 states, 2854 states have (on average 3.084092501751927) internal successors, (8802), 2854 states have internal predecessors, (8802), 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-07-13 18:55:00,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2855 states to 2855 states and 8802 transitions. [2021-07-13 18:55:00,169 INFO L78 Accepts]: Start accepts. Automaton has 2855 states and 8802 transitions. Word has length 77 [2021-07-13 18:55:00,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:55:00,169 INFO L482 AbstractCegarLoop]: Abstraction has 2855 states and 8802 transitions. [2021-07-13 18:55:00,169 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-07-13 18:55:00,169 INFO L276 IsEmpty]: Start isEmpty. Operand 2855 states and 8802 transitions. [2021-07-13 18:55:00,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-07-13 18:55:00,173 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:55:00,173 INFO L508 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] [2021-07-13 18:55:00,173 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-07-13 18:55:00,173 INFO L430 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:55:00,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:55:00,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1281429161, now seen corresponding path program 1 times [2021-07-13 18:55:00,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:55:00,173 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330330475] [2021-07-13 18:55:00,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:55:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:55:00,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:55:00,247 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:55:00,247 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330330475] [2021-07-13 18:55:00,247 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330330475] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:55:00,247 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:55:00,247 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-13 18:55:00,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179069466] [2021-07-13 18:55:00,247 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-13 18:55:00,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:55:00,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-13 18:55:00,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-07-13 18:55:00,248 INFO L87 Difference]: Start difference. First operand 2855 states and 8802 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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-07-13 18:55:00,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:55:00,341 INFO L93 Difference]: Finished difference Result 2897 states and 8728 transitions. [2021-07-13 18:55:00,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-13 18:55:00,341 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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 78 [2021-07-13 18:55:00,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:55:00,345 INFO L225 Difference]: With dead ends: 2897 [2021-07-13 18:55:00,345 INFO L226 Difference]: Without dead ends: 2081 [2021-07-13 18:55:00,345 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 70.3ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-07-13 18:55:00,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2081 states. [2021-07-13 18:55:00,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2081 to 1976. [2021-07-13 18:55:00,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1976 states, 1975 states have (on average 2.979746835443038) internal successors, (5885), 1975 states have internal predecessors, (5885), 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-07-13 18:55:00,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 5885 transitions. [2021-07-13 18:55:00,373 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 5885 transitions. Word has length 78 [2021-07-13 18:55:00,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:55:00,373 INFO L482 AbstractCegarLoop]: Abstraction has 1976 states and 5885 transitions. [2021-07-13 18:55:00,373 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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-07-13 18:55:00,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 5885 transitions. [2021-07-13 18:55:00,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-07-13 18:55:00,375 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:55:00,375 INFO L508 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-07-13 18:55:00,375 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-07-13 18:55:00,375 INFO L430 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:55:00,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:55:00,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1288565066, now seen corresponding path program 1 times [2021-07-13 18:55:00,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:55:00,376 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437511123] [2021-07-13 18:55:00,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:55:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:55:00,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:55:00,449 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:55:00,449 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437511123] [2021-07-13 18:55:00,449 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437511123] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:55:00,449 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:55:00,449 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-13 18:55:00,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96330629] [2021-07-13 18:55:00,449 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-13 18:55:00,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:55:00,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-13 18:55:00,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-07-13 18:55:00,450 INFO L87 Difference]: Start difference. First operand 1976 states and 5885 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 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-07-13 18:55:00,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:55:00,557 INFO L93 Difference]: Finished difference Result 1670 states and 4820 transitions. [2021-07-13 18:55:00,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-13 18:55:00,558 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 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-07-13 18:55:00,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:55:00,559 INFO L225 Difference]: With dead ends: 1670 [2021-07-13 18:55:00,559 INFO L226 Difference]: Without dead ends: 807 [2021-07-13 18:55:00,559 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 88.9ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-07-13 18:55:00,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2021-07-13 18:55:00,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 807. [2021-07-13 18:55:00,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 806 states have (on average 2.7841191066997517) internal successors, (2244), 806 states have internal predecessors, (2244), 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-07-13 18:55:00,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 2244 transitions. [2021-07-13 18:55:00,568 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 2244 transitions. Word has length 80 [2021-07-13 18:55:00,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:55:00,568 INFO L482 AbstractCegarLoop]: Abstraction has 807 states and 2244 transitions. [2021-07-13 18:55:00,569 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 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-07-13 18:55:00,569 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 2244 transitions. [2021-07-13 18:55:00,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-07-13 18:55:00,570 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:55:00,570 INFO L508 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-07-13 18:55:00,570 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-07-13 18:55:00,570 INFO L430 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:55:00,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:55:00,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1752140297, now seen corresponding path program 1 times [2021-07-13 18:55:00,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:55:00,571 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587583301] [2021-07-13 18:55:00,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:55:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-13 18:55:00,606 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-13 18:55:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-13 18:55:00,653 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-13 18:55:00,681 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-13 18:55:00,681 INFO L609 BasicCegarLoop]: Counterexample might be feasible [2021-07-13 18:55:00,681 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-07-13 18:55:00,681 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2021-07-13 18:55:00,683 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-07-13 18:55:00,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 06:55:00 BasicIcfg [2021-07-13 18:55:00,762 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-13 18:55:00,762 INFO L168 Benchmark]: Toolchain (without parser) took 21199.13 ms. Allocated memory was 169.9 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 132.7 MB in the beginning and 698.2 MB in the end (delta: -565.6 MB). Peak memory consumption was 832.8 MB. Max. memory is 8.0 GB. [2021-07-13 18:55:00,763 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 169.9 MB. Free memory is still 150.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-07-13 18:55:00,763 INFO L168 Benchmark]: CACSL2BoogieTranslator took 470.82 ms. Allocated memory is still 169.9 MB. Free memory was 132.5 MB in the beginning and 138.3 MB in the end (delta: -5.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-07-13 18:55:00,763 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.70 ms. Allocated memory is still 169.9 MB. Free memory was 138.3 MB in the beginning and 135.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-07-13 18:55:00,763 INFO L168 Benchmark]: Boogie Preprocessor took 48.23 ms. Allocated memory is still 169.9 MB. Free memory was 135.2 MB in the beginning and 132.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-07-13 18:55:00,763 INFO L168 Benchmark]: RCFGBuilder took 2662.87 ms. Allocated memory was 169.9 MB in the beginning and 204.5 MB in the end (delta: 34.6 MB). Free memory was 132.0 MB in the beginning and 151.3 MB in the end (delta: -19.3 MB). Peak memory consumption was 108.6 MB. Max. memory is 8.0 GB. [2021-07-13 18:55:00,763 INFO L168 Benchmark]: TraceAbstraction took 17965.44 ms. Allocated memory was 204.5 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 150.8 MB in the beginning and 698.2 MB in the end (delta: -547.4 MB). Peak memory consumption was 815.7 MB. Max. memory is 8.0 GB. [2021-07-13 18:55:00,763 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.16 ms. Allocated memory is still 169.9 MB. Free memory is still 150.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 470.82 ms. Allocated memory is still 169.9 MB. Free memory was 132.5 MB in the beginning and 138.3 MB in the end (delta: -5.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 44.70 ms. Allocated memory is still 169.9 MB. Free memory was 138.3 MB in the beginning and 135.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 48.23 ms. Allocated memory is still 169.9 MB. Free memory was 135.2 MB in the beginning and 132.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2662.87 ms. Allocated memory was 169.9 MB in the beginning and 204.5 MB in the end (delta: 34.6 MB). Free memory was 132.0 MB in the beginning and 151.3 MB in the end (delta: -19.3 MB). Peak memory consumption was 108.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 17965.44 ms. Allocated memory was 204.5 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 150.8 MB in the beginning and 698.2 MB in the end (delta: -547.4 MB). Peak memory consumption was 815.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - CounterExampleResult [Line: 19]: 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L716] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L718] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L720] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L721] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L722] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L723] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L724] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L725] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L726] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L727] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L728] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L729] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L730] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L731] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L732] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L733] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L734] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L736] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L738] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L849] 0 pthread_t t2543; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L850] FCALL, FORK 0 pthread_create(&t2543, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2544; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L852] FCALL, FORK 0 pthread_create(&t2544, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2545; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L854] FCALL, FORK 0 pthread_create(&t2545, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 3 !(!expression) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, 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=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L19] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, 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=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L19] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, 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=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P2Thread1of1ForFork0 with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 614.2ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 30.0ms, AutomataDifference: 124.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 170.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 87 SDtfs, 33 SDslu, 26 SDs, 0 SdLazy, 6 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5632occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 7.1ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 6.6ms SsaConstructionTime, 39.1ms SatisfiabilityAnalysisTime, 105.0ms InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 110 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17125.7ms, OverallIterations: 25, TraceHistogramMax: 1, EmptinessCheckTime: 282.6ms, AutomataDifference: 8493.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 292.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3521 SDtfs, 5820 SDslu, 18527 SDs, 0 SdLazy, 3899 SolverSat, 826 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3533.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 443 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 394 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1321 ImplicationChecksByTransitivity, 5008.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=9601occurred in iteration=0, InterpolantAutomatonStates: 317, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 3016.7ms AutomataMinimizationTime, 24 MinimizatonAttempts, 7631 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 84.1ms SsaConstructionTime, 935.5ms SatisfiabilityAnalysisTime, 3751.3ms InterpolantComputationTime, 1893 NumberOfCodeBlocks, 1893 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1787 ConstructedInterpolants, 0 QuantifiedInterpolants, 14187 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...