/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix019_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:22:34,264 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:22:34,265 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:22:34,283 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:22:34,283 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:22:34,284 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:22:34,285 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:22:34,286 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:22:34,287 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:22:34,288 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:22:34,289 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:22:34,289 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:22:34,290 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:22:34,290 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:22:34,291 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:22:34,292 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:22:34,293 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:22:34,293 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:22:34,294 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:22:34,296 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:22:34,297 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:22:34,297 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:22:34,298 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:22:34,299 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:22:34,300 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:22:34,300 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:22:34,301 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:22:34,301 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:22:34,301 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:22:34,302 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:22:34,302 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:22:34,303 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:22:34,303 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:22:34,304 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:22:34,304 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:22:34,305 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:22:34,305 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:22:34,305 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:22:34,305 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:22:34,306 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:22:34,306 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:22:34,307 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-PN-RepeatedSemanticLbe.epf [2021-03-25 14:22:34,321 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:22:34,321 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:22:34,322 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:22:34,322 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:22:34,322 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:22:34,322 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:22:34,322 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:22:34,323 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:22:34,323 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:22:34,323 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:22:34,323 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:22:34,323 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:22:34,323 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:22:34,323 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:22:34,323 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:22:34,323 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:22:34,323 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:22:34,324 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:22:34,324 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:22:34,324 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:22:34,324 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:22:34,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:22:34,324 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:22:34,324 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:22:34,324 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:22:34,324 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:22:34,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:22:34,325 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:22:34,325 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:22:34,325 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 14:22:34,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:22:34,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:22:34,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:22:34,543 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:22:34,544 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:22:34,545 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_rmo.opt.i [2021-03-25 14:22:34,603 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/430a08e70/d4670ac9156a45d2ab707ef674fd1859/FLAGf08ba8c97 [2021-03-25 14:22:35,007 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:22:35,008 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_rmo.opt.i [2021-03-25 14:22:35,020 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/430a08e70/d4670ac9156a45d2ab707ef674fd1859/FLAGf08ba8c97 [2021-03-25 14:22:35,374 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/430a08e70/d4670ac9156a45d2ab707ef674fd1859 [2021-03-25 14:22:35,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:22:35,376 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:22:35,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:22:35,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:22:35,386 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:22:35,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:22:35" (1/1) ... [2021-03-25 14:22:35,387 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@107db9a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:35, skipping insertion in model container [2021-03-25 14:22:35,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:22:35" (1/1) ... [2021-03-25 14:22:35,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:22:35,429 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:22:35,513 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_rmo.opt.i[948,961] [2021-03-25 14:22:35,654 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:22:35,660 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:22:35,667 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_rmo.opt.i[948,961] [2021-03-25 14:22:35,699 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:22:35,747 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:22:35,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:35 WrapperNode [2021-03-25 14:22:35,747 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:22:35,748 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:22:35,748 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:22:35,748 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:22:35,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:35" (1/1) ... [2021-03-25 14:22:35,762 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:35" (1/1) ... [2021-03-25 14:22:35,781 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:22:35,782 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:22:35,782 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:22:35,782 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:22:35,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:35" (1/1) ... [2021-03-25 14:22:35,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:35" (1/1) ... [2021-03-25 14:22:35,789 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:35" (1/1) ... [2021-03-25 14:22:35,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:35" (1/1) ... [2021-03-25 14:22:35,798 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:35" (1/1) ... [2021-03-25 14:22:35,821 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:35" (1/1) ... [2021-03-25 14:22:35,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:35" (1/1) ... [2021-03-25 14:22:35,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:22:35,827 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:22:35,827 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:22:35,827 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:22:35,827 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:22:35,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:22:35,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:22:35,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:22:35,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:22:35,886 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:22:35,887 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:22:35,887 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:22:35,887 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:22:35,887 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:22:35,887 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:22:35,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:22:35,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:22:35,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:22:35,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:22:35,889 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 14:22:37,498 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:22:37,498 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:22:37,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:22:37 BoogieIcfgContainer [2021-03-25 14:22:37,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:22:37,501 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:22:37,501 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:22:37,503 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:22:37,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:22:35" (1/3) ... [2021-03-25 14:22:37,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e540352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:22:37, skipping insertion in model container [2021-03-25 14:22:37,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:22:35" (2/3) ... [2021-03-25 14:22:37,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e540352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:22:37, skipping insertion in model container [2021-03-25 14:22:37,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:22:37" (3/3) ... [2021-03-25 14:22:37,505 INFO L111 eAbstractionObserver]: Analyzing ICFG mix019_rmo.opt.i [2021-03-25 14:22:37,509 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:22:37,512 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:22:37,512 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:22:37,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,541 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,541 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,541 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,541 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,542 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,542 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,542 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,542 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,547 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,547 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,547 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,547 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,547 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,547 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,548 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,548 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,548 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,548 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,548 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,550 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,550 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,550 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,550 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,550 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,550 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,550 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,550 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,550 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,550 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,550 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,550 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,551 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,551 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,551 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,553 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,553 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,553 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,553 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,553 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,553 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,553 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,554 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,554 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,554 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,554 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,554 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,554 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,554 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,554 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,554 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,555 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,555 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,555 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,555 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,555 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,555 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,555 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,555 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,555 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,555 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,555 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,555 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,555 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,564 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,564 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,564 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,564 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,564 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,564 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,564 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,564 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,564 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,565 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,565 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,565 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,565 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,566 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,567 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,567 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,567 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,570 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,570 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,570 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,570 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,570 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,570 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,570 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,571 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,572 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,572 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,572 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,572 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,572 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,572 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,572 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,572 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,572 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,572 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,572 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,578 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,578 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,578 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,579 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,579 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,580 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,580 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,580 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,580 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,580 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,580 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,580 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,580 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,580 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,580 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,580 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,581 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,581 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,581 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,581 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,581 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:22:37,582 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:22:37,594 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-25 14:22:37,606 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:22:37,606 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:22:37,606 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:22:37,607 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:22:37,607 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:22:37,607 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:22:37,607 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:22:37,607 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:22:37,613 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 211 flow [2021-03-25 14:22:37,637 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-03-25 14:22:37,637 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:22:37,640 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-25 14:22:37,640 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 98 transitions, 211 flow [2021-03-25 14:22:37,643 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 95 transitions, 199 flow [2021-03-25 14:22:37,644 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:37,652 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 95 transitions, 199 flow [2021-03-25 14:22:37,654 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 95 transitions, 199 flow [2021-03-25 14:22:37,655 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 199 flow [2021-03-25 14:22:37,687 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-03-25 14:22:37,687 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:22:37,688 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-25 14:22:37,690 INFO L142 LiptonReduction]: Number of co-enabled transitions 1566 [2021-03-25 14:22:38,638 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:22:38,967 WARN L205 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 14:22:39,075 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 14:22:39,885 INFO L154 LiptonReduction]: Checked pairs total: 2182 [2021-03-25 14:22:39,885 INFO L156 LiptonReduction]: Total number of compositions: 62 [2021-03-25 14:22:39,889 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2246 [2021-03-25 14:22:39,900 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-25 14:22:39,900 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:22:39,900 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:39,901 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:22:39,901 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:39,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:39,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1946552907, now seen corresponding path program 1 times [2021-03-25 14:22:39,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:39,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645944244] [2021-03-25 14:22:39,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:40,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:40,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:22:40,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:40,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:40,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-03-25 14:22:40,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645944244] [2021-03-25 14:22:40,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:40,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:22:40,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918674083] [2021-03-25 14:22:40,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:22:40,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:40,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:22:40,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:22:40,107 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 160 [2021-03-25 14:22:40,109 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:40,109 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:40,109 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 160 [2021-03-25 14:22:40,109 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:40,159 INFO L129 PetriNetUnfolder]: 13/67 cut-off events. [2021-03-25 14:22:40,159 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:22:40,159 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 67 events. 13/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 170 event pairs, 1 based on Foata normal form. 7/70 useless extension candidates. Maximal degree in co-relation 86. Up to 25 conditions per place. [2021-03-25 14:22:40,161 INFO L132 encePairwiseOnDemand]: 156/160 looper letters, 6 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2021-03-25 14:22:40,161 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 39 transitions, 103 flow [2021-03-25 14:22:40,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:22:40,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:22:40,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2021-03-25 14:22:40,173 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8979166666666667 [2021-03-25 14:22:40,174 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2021-03-25 14:22:40,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2021-03-25 14:22:40,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:40,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2021-03-25 14:22:40,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:40,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:40,193 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:40,194 INFO L185 Difference]: Start difference. First operand has 49 places, 40 transitions, 89 flow. Second operand 3 states and 431 transitions. [2021-03-25 14:22:40,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 39 transitions, 103 flow [2021-03-25 14:22:40,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 39 transitions, 100 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 14:22:40,197 INFO L241 Difference]: Finished difference. Result has 46 places, 37 transitions, 84 flow [2021-03-25 14:22:40,198 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2021-03-25 14:22:40,200 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2021-03-25 14:22:40,200 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:40,200 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 37 transitions, 84 flow [2021-03-25 14:22:40,201 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 37 transitions, 84 flow [2021-03-25 14:22:40,206 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 37 transitions, 84 flow [2021-03-25 14:22:40,209 INFO L129 PetriNetUnfolder]: 0/37 cut-off events. [2021-03-25 14:22:40,209 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:22:40,209 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 0/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:22:40,210 INFO L142 LiptonReduction]: Number of co-enabled transitions 312 [2021-03-25 14:22:40,503 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 14:22:41,464 INFO L154 LiptonReduction]: Checked pairs total: 1160 [2021-03-25 14:22:41,464 INFO L156 LiptonReduction]: Total number of compositions: 14 [2021-03-25 14:22:41,464 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1264 [2021-03-25 14:22:41,465 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2021-03-25 14:22:41,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:41,465 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:41,465 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:22:41,465 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:22:41,465 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:41,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:41,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1783552995, now seen corresponding path program 1 times [2021-03-25 14:22:41,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:41,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113589044] [2021-03-25 14:22:41,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:41,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:41,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:22:41,557 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-25 14:22:41,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 14:22:41,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:41,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:22:41,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:22:41,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113589044] [2021-03-25 14:22:41,569 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:41,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:22:41,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935950612] [2021-03-25 14:22:41,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:22:41,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:41,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:22:41,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:22:41,571 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 174 [2021-03-25 14:22:41,572 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:41,572 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:41,572 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 174 [2021-03-25 14:22:41,572 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:41,640 INFO L129 PetriNetUnfolder]: 101/253 cut-off events. [2021-03-25 14:22:41,640 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:22:41,640 INFO L84 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 253 events. 101/253 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1290 event pairs, 20 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 438. Up to 81 conditions per place. [2021-03-25 14:22:41,641 INFO L132 encePairwiseOnDemand]: 166/174 looper letters, 7 selfloop transitions, 6 changer transitions 12/39 dead transitions. [2021-03-25 14:22:41,641 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 39 transitions, 138 flow [2021-03-25 14:22:41,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:22:41,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:22:41,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 716 transitions. [2021-03-25 14:22:41,643 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8229885057471265 [2021-03-25 14:22:41,643 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 716 transitions. [2021-03-25 14:22:41,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 716 transitions. [2021-03-25 14:22:41,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:41,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 716 transitions. [2021-03-25 14:22:41,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.2) internal successors, (716), 5 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:41,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:41,646 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:41,646 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 5 states and 716 transitions. [2021-03-25 14:22:41,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 39 transitions, 138 flow [2021-03-25 14:22:41,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:22:41,647 INFO L241 Difference]: Finished difference. Result has 38 places, 27 transitions, 106 flow [2021-03-25 14:22:41,647 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=106, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2021-03-25 14:22:41,648 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -11 predicate places. [2021-03-25 14:22:41,648 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:41,648 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 27 transitions, 106 flow [2021-03-25 14:22:41,648 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 27 transitions, 106 flow [2021-03-25 14:22:41,649 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 27 transitions, 106 flow [2021-03-25 14:22:41,662 INFO L129 PetriNetUnfolder]: 48/154 cut-off events. [2021-03-25 14:22:41,662 INFO L130 PetriNetUnfolder]: For 34/36 co-relation queries the response was YES. [2021-03-25 14:22:41,662 INFO L84 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 154 events. 48/154 cut-off events. For 34/36 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 752 event pairs, 20 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 332. Up to 81 conditions per place. [2021-03-25 14:22:41,663 INFO L142 LiptonReduction]: Number of co-enabled transitions 210 [2021-03-25 14:22:42,149 WARN L205 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-03-25 14:22:42,259 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-25 14:22:42,521 WARN L205 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-03-25 14:22:42,638 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-25 14:22:42,643 INFO L154 LiptonReduction]: Checked pairs total: 489 [2021-03-25 14:22:42,643 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:22:42,644 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 996 [2021-03-25 14:22:42,644 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 102 flow [2021-03-25 14:22:42,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:42,645 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:42,645 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:22:42,645 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:22:42,645 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:42,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:42,645 INFO L82 PathProgramCache]: Analyzing trace with hash -269481430, now seen corresponding path program 1 times [2021-03-25 14:22:42,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:42,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993907589] [2021-03-25 14:22:42,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:42,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:42,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:42,706 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-25 14:22:42,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 14:22:42,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:22:42,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993907589] [2021-03-25 14:22:42,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:42,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:22:42,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090622845] [2021-03-25 14:22:42,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:22:42,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:42,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:22:42,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:22:42,714 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 176 [2021-03-25 14:22:42,714 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:42,714 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:42,715 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 176 [2021-03-25 14:22:42,715 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:42,743 INFO L129 PetriNetUnfolder]: 39/121 cut-off events. [2021-03-25 14:22:42,743 INFO L130 PetriNetUnfolder]: For 63/144 co-relation queries the response was YES. [2021-03-25 14:22:42,743 INFO L84 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 121 events. 39/121 cut-off events. For 63/144 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 499 event pairs, 6 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 357. Up to 68 conditions per place. [2021-03-25 14:22:42,744 INFO L132 encePairwiseOnDemand]: 169/176 looper letters, 9 selfloop transitions, 7 changer transitions 0/29 dead transitions. [2021-03-25 14:22:42,744 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 29 transitions, 158 flow [2021-03-25 14:22:42,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:22:42,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:22:42,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 582 transitions. [2021-03-25 14:22:42,746 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8267045454545454 [2021-03-25 14:22:42,746 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 582 transitions. [2021-03-25 14:22:42,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 582 transitions. [2021-03-25 14:22:42,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:42,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 582 transitions. [2021-03-25 14:22:42,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.5) internal successors, (582), 4 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:42,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:42,748 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:42,749 INFO L185 Difference]: Start difference. First operand has 33 places, 25 transitions, 102 flow. Second operand 4 states and 582 transitions. [2021-03-25 14:22:42,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 29 transitions, 158 flow [2021-03-25 14:22:42,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 29 transitions, 128 flow, removed 6 selfloop flow, removed 4 redundant places. [2021-03-25 14:22:42,750 INFO L241 Difference]: Finished difference. Result has 35 places, 28 transitions, 128 flow [2021-03-25 14:22:42,750 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2021-03-25 14:22:42,751 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -14 predicate places. [2021-03-25 14:22:42,751 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:42,751 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 28 transitions, 128 flow [2021-03-25 14:22:42,753 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 28 transitions, 128 flow [2021-03-25 14:22:42,754 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 28 transitions, 128 flow [2021-03-25 14:22:42,767 INFO L129 PetriNetUnfolder]: 39/135 cut-off events. [2021-03-25 14:22:42,767 INFO L130 PetriNetUnfolder]: For 72/77 co-relation queries the response was YES. [2021-03-25 14:22:42,767 INFO L84 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 135 events. 39/135 cut-off events. For 72/77 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 634 event pairs, 14 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 304. Up to 68 conditions per place. [2021-03-25 14:22:42,768 INFO L142 LiptonReduction]: Number of co-enabled transitions 226 [2021-03-25 14:22:42,770 INFO L154 LiptonReduction]: Checked pairs total: 206 [2021-03-25 14:22:42,770 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:22:42,770 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 19 [2021-03-25 14:22:42,774 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 128 flow [2021-03-25 14:22:42,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:42,774 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:42,774 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:22:42,774 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:22:42,774 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:42,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:42,775 INFO L82 PathProgramCache]: Analyzing trace with hash 379101862, now seen corresponding path program 1 times [2021-03-25 14:22:42,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:42,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111845070] [2021-03-25 14:22:42,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:42,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:42,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:42,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:22:42,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111845070] [2021-03-25 14:22:42,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:42,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 14:22:42,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049274745] [2021-03-25 14:22:42,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:22:42,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:42,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:22:42,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:22:42,832 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 176 [2021-03-25 14:22:42,833 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:42,833 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:42,833 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 176 [2021-03-25 14:22:42,833 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:42,871 INFO L129 PetriNetUnfolder]: 33/111 cut-off events. [2021-03-25 14:22:42,872 INFO L130 PetriNetUnfolder]: For 120/157 co-relation queries the response was YES. [2021-03-25 14:22:42,872 INFO L84 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 111 events. 33/111 cut-off events. For 120/157 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 463 event pairs, 13 based on Foata normal form. 3/110 useless extension candidates. Maximal degree in co-relation 291. Up to 60 conditions per place. [2021-03-25 14:22:42,873 INFO L132 encePairwiseOnDemand]: 172/176 looper letters, 6 selfloop transitions, 5 changer transitions 0/31 dead transitions. [2021-03-25 14:22:42,873 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 31 transitions, 168 flow [2021-03-25 14:22:42,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:22:42,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:22:42,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 466 transitions. [2021-03-25 14:22:42,874 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8825757575757576 [2021-03-25 14:22:42,874 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 466 transitions. [2021-03-25 14:22:42,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 466 transitions. [2021-03-25 14:22:42,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:42,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 466 transitions. [2021-03-25 14:22:42,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:42,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:42,876 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:42,876 INFO L185 Difference]: Start difference. First operand has 35 places, 28 transitions, 128 flow. Second operand 3 states and 466 transitions. [2021-03-25 14:22:42,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 31 transitions, 168 flow [2021-03-25 14:22:42,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 31 transitions, 165 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:22:42,878 INFO L241 Difference]: Finished difference. Result has 37 places, 31 transitions, 166 flow [2021-03-25 14:22:42,878 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2021-03-25 14:22:42,878 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -12 predicate places. [2021-03-25 14:22:42,879 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:42,879 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 31 transitions, 166 flow [2021-03-25 14:22:42,879 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 31 transitions, 166 flow [2021-03-25 14:22:42,879 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 166 flow [2021-03-25 14:22:42,891 INFO L129 PetriNetUnfolder]: 33/121 cut-off events. [2021-03-25 14:22:42,892 INFO L130 PetriNetUnfolder]: For 96/104 co-relation queries the response was YES. [2021-03-25 14:22:42,892 INFO L84 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 121 events. 33/121 cut-off events. For 96/104 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 551 event pairs, 12 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 303. Up to 60 conditions per place. [2021-03-25 14:22:42,893 INFO L142 LiptonReduction]: Number of co-enabled transitions 252 [2021-03-25 14:22:42,920 INFO L154 LiptonReduction]: Checked pairs total: 254 [2021-03-25 14:22:42,920 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:22:42,920 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 42 [2021-03-25 14:22:42,921 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 166 flow [2021-03-25 14:22:42,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:42,921 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:42,921 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:22:42,921 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:22:42,921 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:42,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:42,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1111687644, now seen corresponding path program 1 times [2021-03-25 14:22:42,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:42,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751274446] [2021-03-25 14:22:42,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:42,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:42,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:42,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:42,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:22:43,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:43,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:22:43,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:22:43,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751274446] [2021-03-25 14:22:43,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:43,001 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:22:43,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132176000] [2021-03-25 14:22:43,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:22:43,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:43,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:22:43,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:22:43,003 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 176 [2021-03-25 14:22:43,003 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:43,003 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:43,003 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 176 [2021-03-25 14:22:43,004 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:43,051 INFO L129 PetriNetUnfolder]: 139/350 cut-off events. [2021-03-25 14:22:43,051 INFO L130 PetriNetUnfolder]: For 135/156 co-relation queries the response was YES. [2021-03-25 14:22:43,052 INFO L84 FinitePrefix]: Finished finitePrefix Result has 833 conditions, 350 events. 139/350 cut-off events. For 135/156 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2156 event pairs, 57 based on Foata normal form. 36/363 useless extension candidates. Maximal degree in co-relation 817. Up to 195 conditions per place. [2021-03-25 14:22:43,053 INFO L132 encePairwiseOnDemand]: 170/176 looper letters, 8 selfloop transitions, 8 changer transitions 0/41 dead transitions. [2021-03-25 14:22:43,054 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 41 transitions, 218 flow [2021-03-25 14:22:43,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:22:43,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:22:43,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 763 transitions. [2021-03-25 14:22:43,055 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8670454545454546 [2021-03-25 14:22:43,055 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 763 transitions. [2021-03-25 14:22:43,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 763 transitions. [2021-03-25 14:22:43,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:43,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 763 transitions. [2021-03-25 14:22:43,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 152.6) internal successors, (763), 5 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:43,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:43,059 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:43,059 INFO L185 Difference]: Start difference. First operand has 37 places, 31 transitions, 166 flow. Second operand 5 states and 763 transitions. [2021-03-25 14:22:43,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 41 transitions, 218 flow [2021-03-25 14:22:43,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 211 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-25 14:22:43,061 INFO L241 Difference]: Finished difference. Result has 43 places, 38 transitions, 219 flow [2021-03-25 14:22:43,061 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=219, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2021-03-25 14:22:43,061 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -6 predicate places. [2021-03-25 14:22:43,061 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:43,061 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 38 transitions, 219 flow [2021-03-25 14:22:43,062 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 38 transitions, 219 flow [2021-03-25 14:22:43,062 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 38 transitions, 219 flow [2021-03-25 14:22:43,090 INFO L129 PetriNetUnfolder]: 141/355 cut-off events. [2021-03-25 14:22:43,090 INFO L130 PetriNetUnfolder]: For 306/380 co-relation queries the response was YES. [2021-03-25 14:22:43,091 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 355 events. 141/355 cut-off events. For 306/380 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2231 event pairs, 56 based on Foata normal form. 8/336 useless extension candidates. Maximal degree in co-relation 1028. Up to 199 conditions per place. [2021-03-25 14:22:43,093 INFO L142 LiptonReduction]: Number of co-enabled transitions 378 [2021-03-25 14:22:43,099 INFO L154 LiptonReduction]: Checked pairs total: 327 [2021-03-25 14:22:43,099 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:22:43,100 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 39 [2021-03-25 14:22:43,102 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 213 flow [2021-03-25 14:22:43,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:43,103 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:43,103 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:22:43,103 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:22:43,103 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:43,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:43,109 INFO L82 PathProgramCache]: Analyzing trace with hash -350661897, now seen corresponding path program 1 times [2021-03-25 14:22:43,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:43,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680539933] [2021-03-25 14:22:43,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:43,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:43,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:22:43,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:43,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:43,172 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-25 14:22:43,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 14:22:43,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:22:43,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680539933] [2021-03-25 14:22:43,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:43,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:22:43,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839715648] [2021-03-25 14:22:43,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:22:43,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:43,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:22:43,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:22:43,179 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 176 [2021-03-25 14:22:43,180 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 213 flow. Second operand has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:43,180 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:43,180 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 176 [2021-03-25 14:22:43,180 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:43,230 INFO L129 PetriNetUnfolder]: 146/354 cut-off events. [2021-03-25 14:22:43,230 INFO L130 PetriNetUnfolder]: For 458/589 co-relation queries the response was YES. [2021-03-25 14:22:43,231 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1117 conditions, 354 events. 146/354 cut-off events. For 458/589 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2058 event pairs, 68 based on Foata normal form. 28/350 useless extension candidates. Maximal degree in co-relation 1097. Up to 210 conditions per place. [2021-03-25 14:22:43,232 INFO L132 encePairwiseOnDemand]: 171/176 looper letters, 9 selfloop transitions, 9 changer transitions 4/38 dead transitions. [2021-03-25 14:22:43,232 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 38 transitions, 261 flow [2021-03-25 14:22:43,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:22:43,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:22:43,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2021-03-25 14:22:43,234 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.828125 [2021-03-25 14:22:43,234 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 583 transitions. [2021-03-25 14:22:43,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 583 transitions. [2021-03-25 14:22:43,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:43,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 583 transitions. [2021-03-25 14:22:43,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:43,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:43,236 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:43,236 INFO L185 Difference]: Start difference. First operand has 43 places, 37 transitions, 213 flow. Second operand 4 states and 583 transitions. [2021-03-25 14:22:43,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 38 transitions, 261 flow [2021-03-25 14:22:43,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 38 transitions, 255 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:22:43,239 INFO L241 Difference]: Finished difference. Result has 44 places, 33 transitions, 216 flow [2021-03-25 14:22:43,239 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2021-03-25 14:22:43,240 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2021-03-25 14:22:43,240 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:43,240 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 33 transitions, 216 flow [2021-03-25 14:22:43,240 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 33 transitions, 216 flow [2021-03-25 14:22:43,240 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 33 transitions, 216 flow [2021-03-25 14:22:43,267 INFO L129 PetriNetUnfolder]: 139/337 cut-off events. [2021-03-25 14:22:43,267 INFO L130 PetriNetUnfolder]: For 397/439 co-relation queries the response was YES. [2021-03-25 14:22:43,268 INFO L84 FinitePrefix]: Finished finitePrefix Result has 971 conditions, 337 events. 139/337 cut-off events. For 397/439 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 1943 event pairs, 64 based on Foata normal form. 2/315 useless extension candidates. Maximal degree in co-relation 951. Up to 201 conditions per place. [2021-03-25 14:22:43,269 INFO L142 LiptonReduction]: Number of co-enabled transitions 252 [2021-03-25 14:22:43,273 INFO L154 LiptonReduction]: Checked pairs total: 105 [2021-03-25 14:22:43,273 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:22:43,273 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 33 [2021-03-25 14:22:43,274 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 216 flow [2021-03-25 14:22:43,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:43,274 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:43,274 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:22:43,275 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:22:43,275 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:43,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:43,275 INFO L82 PathProgramCache]: Analyzing trace with hash -616062832, now seen corresponding path program 1 times [2021-03-25 14:22:43,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:43,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349310194] [2021-03-25 14:22:43,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:43,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:43,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:43,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:43,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:43,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:43,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:22:43,362 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:43,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:22:43,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:22:43,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349310194] [2021-03-25 14:22:43,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:43,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:22:43,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215307379] [2021-03-25 14:22:43,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:22:43,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:43,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:22:43,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:22:43,364 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 176 [2021-03-25 14:22:43,364 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 216 flow. Second operand has 5 states, 5 states have (on average 149.8) internal successors, (749), 5 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:43,364 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:43,364 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 176 [2021-03-25 14:22:43,364 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:43,407 INFO L129 PetriNetUnfolder]: 79/247 cut-off events. [2021-03-25 14:22:43,407 INFO L130 PetriNetUnfolder]: For 329/451 co-relation queries the response was YES. [2021-03-25 14:22:43,408 INFO L84 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 247 events. 79/247 cut-off events. For 329/451 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1377 event pairs, 14 based on Foata normal form. 72/312 useless extension candidates. Maximal degree in co-relation 861. Up to 162 conditions per place. [2021-03-25 14:22:43,408 INFO L132 encePairwiseOnDemand]: 170/176 looper letters, 5 selfloop transitions, 11 changer transitions 4/43 dead transitions. [2021-03-25 14:22:43,408 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 43 transitions, 312 flow [2021-03-25 14:22:43,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:22:43,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:22:43,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 915 transitions. [2021-03-25 14:22:43,410 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8664772727272727 [2021-03-25 14:22:43,410 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 915 transitions. [2021-03-25 14:22:43,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 915 transitions. [2021-03-25 14:22:43,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:43,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 915 transitions. [2021-03-25 14:22:43,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 152.5) internal successors, (915), 6 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:43,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:43,413 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:43,414 INFO L185 Difference]: Start difference. First operand has 44 places, 33 transitions, 216 flow. Second operand 6 states and 915 transitions. [2021-03-25 14:22:43,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 43 transitions, 312 flow [2021-03-25 14:22:43,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 43 transitions, 297 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-03-25 14:22:43,415 INFO L241 Difference]: Finished difference. Result has 51 places, 39 transitions, 282 flow [2021-03-25 14:22:43,416 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=282, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2021-03-25 14:22:43,416 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2021-03-25 14:22:43,416 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:43,416 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 39 transitions, 282 flow [2021-03-25 14:22:43,416 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 39 transitions, 282 flow [2021-03-25 14:22:43,416 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 39 transitions, 282 flow [2021-03-25 14:22:43,431 INFO L129 PetriNetUnfolder]: 67/215 cut-off events. [2021-03-25 14:22:43,432 INFO L130 PetriNetUnfolder]: For 513/541 co-relation queries the response was YES. [2021-03-25 14:22:43,432 INFO L84 FinitePrefix]: Finished finitePrefix Result has 859 conditions, 215 events. 67/215 cut-off events. For 513/541 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1220 event pairs, 10 based on Foata normal form. 1/214 useless extension candidates. Maximal degree in co-relation 835. Up to 139 conditions per place. [2021-03-25 14:22:43,433 INFO L142 LiptonReduction]: Number of co-enabled transitions 290 [2021-03-25 14:22:43,466 INFO L154 LiptonReduction]: Checked pairs total: 317 [2021-03-25 14:22:43,467 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:22:43,467 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 51 [2021-03-25 14:22:43,467 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 274 flow [2021-03-25 14:22:43,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 149.8) internal successors, (749), 5 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:43,468 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:43,468 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:22:43,468 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:22:43,468 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:43,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:43,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1630968189, now seen corresponding path program 1 times [2021-03-25 14:22:43,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:43,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233777761] [2021-03-25 14:22:43,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:43,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:43,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:43,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:43,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:43,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:43,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:43,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:43,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:22:43,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:43,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:22:43,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:22:43,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233777761] [2021-03-25 14:22:43,541 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:43,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:22:43,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036644656] [2021-03-25 14:22:43,541 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:22:43,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:43,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:22:43,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:22:43,542 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 176 [2021-03-25 14:22:43,543 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 149.83333333333334) internal successors, (899), 6 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:43,543 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:43,543 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 176 [2021-03-25 14:22:43,543 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:43,587 INFO L129 PetriNetUnfolder]: 39/142 cut-off events. [2021-03-25 14:22:43,587 INFO L130 PetriNetUnfolder]: For 407/470 co-relation queries the response was YES. [2021-03-25 14:22:43,587 INFO L84 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 142 events. 39/142 cut-off events. For 407/470 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 635 event pairs, 5 based on Foata normal form. 48/186 useless extension candidates. Maximal degree in co-relation 591. Up to 86 conditions per place. [2021-03-25 14:22:43,588 INFO L132 encePairwiseOnDemand]: 170/176 looper letters, 2 selfloop transitions, 11 changer transitions 6/39 dead transitions. [2021-03-25 14:22:43,588 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 39 transitions, 306 flow [2021-03-25 14:22:43,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:22:43,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:22:43,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1061 transitions. [2021-03-25 14:22:43,590 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8612012987012987 [2021-03-25 14:22:43,590 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1061 transitions. [2021-03-25 14:22:43,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1061 transitions. [2021-03-25 14:22:43,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:43,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1061 transitions. [2021-03-25 14:22:43,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 151.57142857142858) internal successors, (1061), 7 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:43,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 176.0) internal successors, (1408), 8 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:43,594 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 176.0) internal successors, (1408), 8 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:43,594 INFO L185 Difference]: Start difference. First operand has 51 places, 38 transitions, 274 flow. Second operand 7 states and 1061 transitions. [2021-03-25 14:22:43,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 39 transitions, 306 flow [2021-03-25 14:22:43,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 39 transitions, 278 flow, removed 10 selfloop flow, removed 4 redundant places. [2021-03-25 14:22:43,597 INFO L241 Difference]: Finished difference. Result has 54 places, 33 transitions, 231 flow [2021-03-25 14:22:43,597 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=231, PETRI_PLACES=54, PETRI_TRANSITIONS=33} [2021-03-25 14:22:43,597 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2021-03-25 14:22:43,597 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:43,597 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 33 transitions, 231 flow [2021-03-25 14:22:43,597 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 33 transitions, 231 flow [2021-03-25 14:22:43,598 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 33 transitions, 231 flow [2021-03-25 14:22:43,603 INFO L129 PetriNetUnfolder]: 15/62 cut-off events. [2021-03-25 14:22:43,604 INFO L130 PetriNetUnfolder]: For 109/110 co-relation queries the response was YES. [2021-03-25 14:22:43,604 INFO L84 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 62 events. 15/62 cut-off events. For 109/110 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 180 event pairs, 0 based on Foata normal form. 1/63 useless extension candidates. Maximal degree in co-relation 225. Up to 20 conditions per place. [2021-03-25 14:22:43,604 INFO L142 LiptonReduction]: Number of co-enabled transitions 146 [2021-03-25 14:22:43,876 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 14:22:43,982 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 14:22:44,256 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-25 14:22:44,374 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-25 14:22:44,377 INFO L154 LiptonReduction]: Checked pairs total: 252 [2021-03-25 14:22:44,377 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:22:44,377 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 780 [2021-03-25 14:22:44,378 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 30 transitions, 217 flow [2021-03-25 14:22:44,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 149.83333333333334) internal successors, (899), 6 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:44,378 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:44,378 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:22:44,378 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:22:44,378 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:44,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:44,379 INFO L82 PathProgramCache]: Analyzing trace with hash -223931340, now seen corresponding path program 1 times [2021-03-25 14:22:44,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:44,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502514010] [2021-03-25 14:22:44,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:22:44,411 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:44,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:22:44,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:44,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:44,414 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:22:44,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:22:44,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:22:44,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502514010] [2021-03-25 14:22:44,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:22:44,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:22:44,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351882581] [2021-03-25 14:22:44,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:22:44,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:22:44,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:22:44,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:22:44,420 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 178 [2021-03-25 14:22:44,420 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 30 transitions, 217 flow. Second operand has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:44,420 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:22:44,420 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 178 [2021-03-25 14:22:44,420 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:22:44,439 INFO L129 PetriNetUnfolder]: 21/77 cut-off events. [2021-03-25 14:22:44,440 INFO L130 PetriNetUnfolder]: For 325/342 co-relation queries the response was YES. [2021-03-25 14:22:44,440 INFO L84 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 77 events. 21/77 cut-off events. For 325/342 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 249 event pairs, 2 based on Foata normal form. 9/84 useless extension candidates. Maximal degree in co-relation 285. Up to 27 conditions per place. [2021-03-25 14:22:44,440 INFO L132 encePairwiseOnDemand]: 175/178 looper letters, 3 selfloop transitions, 1 changer transitions 7/31 dead transitions. [2021-03-25 14:22:44,440 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 31 transitions, 233 flow [2021-03-25 14:22:44,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:22:44,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:22:44,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 594 transitions. [2021-03-25 14:22:44,441 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8342696629213483 [2021-03-25 14:22:44,441 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 594 transitions. [2021-03-25 14:22:44,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 594 transitions. [2021-03-25 14:22:44,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:22:44,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 594 transitions. [2021-03-25 14:22:44,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 148.5) internal successors, (594), 4 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:44,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 178.0) internal successors, (890), 5 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:44,445 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 178.0) internal successors, (890), 5 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:44,445 INFO L185 Difference]: Start difference. First operand has 50 places, 30 transitions, 217 flow. Second operand 4 states and 594 transitions. [2021-03-25 14:22:44,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 31 transitions, 233 flow [2021-03-25 14:22:44,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 31 transitions, 185 flow, removed 12 selfloop flow, removed 9 redundant places. [2021-03-25 14:22:44,447 INFO L241 Difference]: Finished difference. Result has 46 places, 24 transitions, 135 flow [2021-03-25 14:22:44,447 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=46, PETRI_TRANSITIONS=24} [2021-03-25 14:22:44,447 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2021-03-25 14:22:44,447 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:22:44,447 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 24 transitions, 135 flow [2021-03-25 14:22:44,447 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 24 transitions, 135 flow [2021-03-25 14:22:44,448 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 24 transitions, 135 flow [2021-03-25 14:22:44,453 INFO L129 PetriNetUnfolder]: 6/35 cut-off events. [2021-03-25 14:22:44,453 INFO L130 PetriNetUnfolder]: For 97/103 co-relation queries the response was YES. [2021-03-25 14:22:44,453 INFO L84 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 35 events. 6/35 cut-off events. For 97/103 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 65 event pairs, 0 based on Foata normal form. 4/38 useless extension candidates. Maximal degree in co-relation 98. Up to 10 conditions per place. [2021-03-25 14:22:44,453 INFO L142 LiptonReduction]: Number of co-enabled transitions 48 [2021-03-25 14:22:45,008 WARN L205 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 172 [2021-03-25 14:22:45,257 WARN L205 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2021-03-25 14:22:46,355 WARN L205 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 296 DAG size of output: 252 [2021-03-25 14:22:46,831 WARN L205 SmtUtils]: Spent 474.00 ms on a formula simplification that was a NOOP. DAG size: 249 [2021-03-25 14:22:47,388 WARN L205 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-25 14:22:47,621 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-25 14:22:48,729 WARN L205 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-25 14:22:49,204 WARN L205 SmtUtils]: Spent 474.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-25 14:22:49,601 WARN L205 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 162 [2021-03-25 14:22:49,706 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2021-03-25 14:22:50,750 WARN L205 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 286 DAG size of output: 229 [2021-03-25 14:22:50,989 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2021-03-25 14:22:50,991 INFO L154 LiptonReduction]: Checked pairs total: 91 [2021-03-25 14:22:50,991 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 14:22:50,991 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6544 [2021-03-25 14:22:50,991 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 20 transitions, 123 flow [2021-03-25 14:22:50,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:22:50,992 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:22:50,992 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:22:50,992 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:22:50,992 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:22:50,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:22:50,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1857852552, now seen corresponding path program 1 times [2021-03-25 14:22:50,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:22:50,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792072911] [2021-03-25 14:22:50,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:22:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:22:51,029 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:22:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:22:51,055 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:22:51,074 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:22:51,074 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:22:51,075 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:22:51,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:22:51 BasicIcfg [2021-03-25 14:22:51,135 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:22:51,137 INFO L168 Benchmark]: Toolchain (without parser) took 15759.60 ms. Allocated memory was 255.9 MB in the beginning and 641.7 MB in the end (delta: 385.9 MB). Free memory was 234.4 MB in the beginning and 265.8 MB in the end (delta: -31.4 MB). Peak memory consumption was 353.3 MB. Max. memory is 16.0 GB. [2021-03-25 14:22:51,137 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:22:51,138 INFO L168 Benchmark]: CACSL2BoogieTranslator took 370.30 ms. Allocated memory was 255.9 MB in the beginning and 360.7 MB in the end (delta: 104.9 MB). Free memory was 234.4 MB in the beginning and 320.5 MB in the end (delta: -86.1 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-25 14:22:51,138 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.41 ms. Allocated memory is still 360.7 MB. Free memory was 320.5 MB in the beginning and 317.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 14:22:51,138 INFO L168 Benchmark]: Boogie Preprocessor took 44.23 ms. Allocated memory is still 360.7 MB. Free memory was 317.7 MB in the beginning and 314.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:22:51,138 INFO L168 Benchmark]: RCFGBuilder took 1673.25 ms. Allocated memory is still 360.7 MB. Free memory was 314.9 MB in the beginning and 168.3 MB in the end (delta: 146.6 MB). Peak memory consumption was 151.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:22:51,138 INFO L168 Benchmark]: TraceAbstraction took 13634.66 ms. Allocated memory was 360.7 MB in the beginning and 641.7 MB in the end (delta: 281.0 MB). Free memory was 168.3 MB in the beginning and 265.8 MB in the end (delta: -97.5 MB). Peak memory consumption was 182.5 MB. Max. memory is 16.0 GB. [2021-03-25 14:22:51,142 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.10 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 370.30 ms. Allocated memory was 255.9 MB in the beginning and 360.7 MB in the end (delta: 104.9 MB). Free memory was 234.4 MB in the beginning and 320.5 MB in the end (delta: -86.1 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 33.41 ms. Allocated memory is still 360.7 MB. Free memory was 320.5 MB in the beginning and 317.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 44.23 ms. Allocated memory is still 360.7 MB. Free memory was 317.7 MB in the beginning and 314.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1673.25 ms. Allocated memory is still 360.7 MB. Free memory was 314.9 MB in the beginning and 168.3 MB in the end (delta: 146.6 MB). Peak memory consumption was 151.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 13634.66 ms. Allocated memory was 360.7 MB in the beginning and 641.7 MB in the end (delta: 281.0 MB). Free memory was 168.3 MB in the beginning and 265.8 MB in the end (delta: -97.5 MB). Peak memory consumption was 182.5 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2231.5ms, 103 PlacesBefore, 49 PlacesAfterwards, 95 TransitionsBefore, 40 TransitionsAfterwards, 1566 CoEnabledTransitionPairs, 4 FixpointIterations, 26 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 1 ChoiceCompositions, 62 TotalNumberOfCompositions, 2182 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1314, positive: 1256, positive conditional: 0, positive unconditional: 1256, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1002, positive: 975, positive conditional: 0, positive unconditional: 975, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1002, positive: 975, positive conditional: 0, positive unconditional: 975, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1002, positive: 969, positive conditional: 0, positive unconditional: 969, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 33, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 370, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 351, negative conditional: 0, negative unconditional: 351, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1314, positive: 281, positive conditional: 0, positive unconditional: 281, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 1002, unknown conditional: 0, unknown unconditional: 1002] , Statistics on independence cache: Total cache size (in pairs): 138, Positive cache size: 123, Positive conditional cache size: 0, Positive unconditional cache size: 123, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1262.4ms, 46 PlacesBefore, 32 PlacesAfterwards, 37 TransitionsBefore, 23 TransitionsAfterwards, 312 CoEnabledTransitionPairs, 4 FixpointIterations, 9 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, 1160 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 482, positive: 399, positive conditional: 0, positive unconditional: 399, negative: 83, negative conditional: 0, negative unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 81, positive: 64, positive conditional: 0, positive unconditional: 64, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 81, positive: 64, positive conditional: 0, positive unconditional: 64, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 81, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 191, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 180, negative conditional: 0, negative unconditional: 180, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 482, positive: 335, positive conditional: 0, positive unconditional: 335, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 81, unknown conditional: 0, unknown unconditional: 81] , Statistics on independence cache: Total cache size (in pairs): 129, Positive cache size: 106, Positive conditional cache size: 0, Positive unconditional cache size: 106, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 995.2ms, 38 PlacesBefore, 33 PlacesAfterwards, 27 TransitionsBefore, 25 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 489 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 213, positive: 180, positive conditional: 0, positive unconditional: 180, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 213, positive: 179, positive conditional: 0, positive unconditional: 179, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 107, Positive conditional cache size: 0, Positive unconditional cache size: 107, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16.6ms, 35 PlacesBefore, 35 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 206 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 59, positive: 47, positive conditional: 0, positive unconditional: 47, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 59, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 112, Positive conditional cache size: 0, Positive unconditional cache size: 112, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 41.1ms, 37 PlacesBefore, 37 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 252 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 254 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 89, positive: 75, positive conditional: 0, positive unconditional: 75, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 89, positive: 73, positive conditional: 0, positive unconditional: 73, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 114, Positive conditional cache size: 0, Positive unconditional cache size: 114, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 38.0ms, 43 PlacesBefore, 43 PlacesAfterwards, 38 TransitionsBefore, 37 TransitionsAfterwards, 378 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 327 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 107, positive: 91, positive conditional: 0, positive unconditional: 91, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 107, positive: 88, positive conditional: 0, positive unconditional: 88, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 125, Positive cache size: 103, Positive conditional cache size: 0, Positive unconditional cache size: 103, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 32.9ms, 44 PlacesBefore, 44 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 252 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 105 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 22, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 125, Positive cache size: 103, Positive conditional cache size: 0, Positive unconditional cache size: 103, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 50.7ms, 51 PlacesBefore, 51 PlacesAfterwards, 39 TransitionsBefore, 38 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 317 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 116, positive: 98, positive conditional: 0, positive unconditional: 98, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 116, positive: 89, positive conditional: 0, positive unconditional: 89, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 128, Positive cache size: 104, Positive conditional cache size: 0, Positive unconditional cache size: 104, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 779.9ms, 54 PlacesBefore, 50 PlacesAfterwards, 33 TransitionsBefore, 30 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 252 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 52, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 52, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 85, Positive conditional cache size: 0, Positive unconditional cache size: 85, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6543.6ms, 46 PlacesBefore, 41 PlacesAfterwards, 24 TransitionsBefore, 20 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 91 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 48, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 59, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 48, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 32, Positive cache size: 28, Positive conditional cache size: 0, Positive unconditional cache size: 28, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L841] 0 pthread_t t512; [L842] FCALL, FORK 0 pthread_create(&t512, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L843] 0 pthread_t t513; [L844] FCALL, FORK 0 pthread_create(&t513, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] 0 pthread_t t514; [L846] FCALL, FORK 0 pthread_create(&t514, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 y$w_buff1 = y$w_buff0 [L789] 3 y$w_buff0 = 1 [L790] 3 y$w_buff1_used = y$w_buff0_used [L791] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L793] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L794] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L795] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L796] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L797] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 y$flush_delayed = weak$$choice2 [L803] 3 y$mem_tmp = y [L804] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1 [L804] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L804] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L805] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L805] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L806] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L806] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L807] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L807] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L808] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L809] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L810] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L810] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EAX = y [L812] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L812] 3 y = y$flush_delayed ? y$mem_tmp : y [L813] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L760] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 y$flush_delayed = weak$$choice2 [L766] 2 y$mem_tmp = y [L767] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L767] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L768] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L768] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L769] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L769] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L770] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L770] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L772] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L773] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EAX = y [L775] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L775] 2 y = y$flush_delayed ? y$mem_tmp : y [L776] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 2 return 0; [L819] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L819] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L820] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L820] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L821] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L821] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L822] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L823] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L823] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 3 return 0; [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L852] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L852] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L852] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L852] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L853] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L853] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L854] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L854] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L855] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L856] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L856] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L859] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 5.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 13471.2ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 513.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2287.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 54 SDtfs, 29 SDslu, 24 SDs, 0 SdLazy, 127 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 109.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 82.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=282occurred in iteration=7, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 28.1ms SsaConstructionTime, 289.9ms SatisfiabilityAnalysisTime, 380.3ms InterpolantComputationTime, 158 NumberOfCodeBlocks, 158 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 131 ConstructedInterpolants, 0 QuantifiedInterpolants, 715 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...