/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-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix014_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-24 10:42:01,845 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-24 10:42:01,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-24 10:42:01,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-24 10:42:01,874 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-24 10:42:01,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-24 10:42:01,880 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-24 10:42:01,884 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-24 10:42:01,886 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-24 10:42:01,889 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-24 10:42:01,890 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-24 10:42:01,890 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-24 10:42:01,891 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-24 10:42:01,892 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-24 10:42:01,893 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-24 10:42:01,896 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-24 10:42:01,896 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-24 10:42:01,897 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-24 10:42:01,899 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-24 10:42:01,900 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-24 10:42:01,901 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-24 10:42:01,904 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-24 10:42:01,905 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-24 10:42:01,906 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-24 10:42:01,912 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-24 10:42:01,912 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-24 10:42:01,912 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-24 10:42:01,913 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-24 10:42:01,913 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-24 10:42:01,914 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-24 10:42:01,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-24 10:42:01,915 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-24 10:42:01,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-24 10:42:01,916 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-24 10:42:01,917 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-24 10:42:01,917 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-24 10:42:01,917 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-24 10:42:01,918 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-24 10:42:01,918 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-24 10:42:01,918 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-24 10:42:01,919 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-24 10:42:01,919 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-VariableLbe.epf [2021-03-24 10:42:01,947 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-24 10:42:01,947 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-24 10:42:01,950 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-24 10:42:01,950 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-24 10:42:01,950 INFO L138 SettingsManager]: * Use SBE=true [2021-03-24 10:42:01,950 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-24 10:42:01,950 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-24 10:42:01,950 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-24 10:42:01,950 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-24 10:42:01,951 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-24 10:42:01,951 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-24 10:42:01,951 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-24 10:42:01,951 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-24 10:42:01,951 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-24 10:42:01,952 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-24 10:42:01,952 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-24 10:42:01,952 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-24 10:42:01,952 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-24 10:42:01,952 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-24 10:42:01,952 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-24 10:42:01,952 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-24 10:42:01,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-24 10:42:01,952 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-24 10:42:01,953 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-24 10:42:01,953 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-24 10:42:01,953 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-24 10:42:01,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-24 10:42:01,953 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-24 10:42:01,953 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-24 10:42:01,953 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-24 10:42:02,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-24 10:42:02,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-24 10:42:02,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-24 10:42:02,206 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-24 10:42:02,206 INFO L275 PluginConnector]: CDTParser initialized [2021-03-24 10:42:02,207 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix014_pso.oepc.i [2021-03-24 10:42:02,258 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a236da09e/6026d5b5545f4ded885ea02f38945ec7/FLAG722ef5b5f [2021-03-24 10:42:02,764 INFO L306 CDTParser]: Found 1 translation units. [2021-03-24 10:42:02,764 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix014_pso.oepc.i [2021-03-24 10:42:02,789 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a236da09e/6026d5b5545f4ded885ea02f38945ec7/FLAG722ef5b5f [2021-03-24 10:42:02,983 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a236da09e/6026d5b5545f4ded885ea02f38945ec7 [2021-03-24 10:42:02,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-24 10:42:02,987 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-24 10:42:02,989 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-24 10:42:02,989 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-24 10:42:02,992 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-24 10:42:02,993 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.03 10:42:02" (1/1) ... [2021-03-24 10:42:02,994 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7328b109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:42:02, skipping insertion in model container [2021-03-24 10:42:02,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.03 10:42:02" (1/1) ... [2021-03-24 10:42:02,998 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-24 10:42:03,039 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-24 10:42:03,168 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/mix014_pso.oepc.i[949,962] [2021-03-24 10:42:03,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-24 10:42:03,359 INFO L203 MainTranslator]: Completed pre-run [2021-03-24 10:42:03,366 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/mix014_pso.oepc.i[949,962] [2021-03-24 10:42:03,429 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-24 10:42:03,488 INFO L208 MainTranslator]: Completed translation [2021-03-24 10:42:03,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:42:03 WrapperNode [2021-03-24 10:42:03,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-24 10:42:03,491 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-24 10:42:03,491 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-24 10:42:03,491 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-24 10:42:03,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:42:03" (1/1) ... [2021-03-24 10:42:03,526 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:42:03" (1/1) ... [2021-03-24 10:42:03,551 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-24 10:42:03,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-24 10:42:03,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-24 10:42:03,552 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-24 10:42:03,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:42:03" (1/1) ... [2021-03-24 10:42:03,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:42:03" (1/1) ... [2021-03-24 10:42:03,561 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:42:03" (1/1) ... [2021-03-24 10:42:03,562 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:42:03" (1/1) ... [2021-03-24 10:42:03,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:42:03" (1/1) ... [2021-03-24 10:42:03,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:42:03" (1/1) ... [2021-03-24 10:42:03,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:42:03" (1/1) ... [2021-03-24 10:42:03,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-24 10:42:03,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-24 10:42:03,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-24 10:42:03,587 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-24 10:42:03,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:42:03" (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-24 10:42:03,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-24 10:42:03,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-24 10:42:03,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-24 10:42:03,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-24 10:42:03,640 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-24 10:42:03,640 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-24 10:42:03,640 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-24 10:42:03,641 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-24 10:42:03,641 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-24 10:42:03,641 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-24 10:42:03,641 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-24 10:42:03,641 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-24 10:42:03,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-24 10:42:03,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-24 10:42:03,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-24 10:42:03,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-24 10:42:03,642 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-24 10:42:05,088 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-24 10:42:05,089 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-24 10:42:05,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.03 10:42:05 BoogieIcfgContainer [2021-03-24 10:42:05,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-24 10:42:05,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-24 10:42:05,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-24 10:42:05,093 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-24 10:42:05,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.03 10:42:02" (1/3) ... [2021-03-24 10:42:05,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e9b565a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.03 10:42:05, skipping insertion in model container [2021-03-24 10:42:05,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:42:03" (2/3) ... [2021-03-24 10:42:05,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e9b565a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.03 10:42:05, skipping insertion in model container [2021-03-24 10:42:05,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.03 10:42:05" (3/3) ... [2021-03-24 10:42:05,094 INFO L111 eAbstractionObserver]: Analyzing ICFG mix014_pso.oepc.i [2021-03-24 10:42:05,098 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-24 10:42:05,101 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-24 10:42:05,101 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-24 10:42:05,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,128 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,128 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,128 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,128 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,128 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,129 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,129 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,129 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,132 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,132 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,132 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,132 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,134 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,134 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,134 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,134 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,134 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,134 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,135 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,135 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,135 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,135 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,135 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,135 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,135 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,135 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,135 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,135 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,137 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,137 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,137 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,137 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,137 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,137 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,137 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,137 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,137 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,137 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,140 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,140 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,140 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,140 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,140 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,140 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,140 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,140 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,144 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,144 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,144 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,144 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,144 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,144 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,145 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,145 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,147 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,147 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,147 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,147 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,147 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,148 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,148 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,149 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,149 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,149 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,149 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,149 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,149 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,149 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,149 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,149 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,149 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,149 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,149 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,150 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,150 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,150 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,150 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,150 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,150 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,150 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,150 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,150 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,150 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,150 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,150 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,150 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,150 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,151 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,151 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,151 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,151 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,151 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,153 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,153 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,153 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,156 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,156 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,162 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,162 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,162 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:42:05,163 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-24 10:42:05,174 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-24 10:42:05,186 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-24 10:42:05,186 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-24 10:42:05,186 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-24 10:42:05,187 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-24 10:42:05,187 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-24 10:42:05,187 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-24 10:42:05,187 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-24 10:42:05,187 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-24 10:42:05,199 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 131 places, 120 transitions, 260 flow [2021-03-24 10:42:05,226 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-03-24 10:42:05,226 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 10:42:05,228 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-24 10:42:05,228 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 120 transitions, 260 flow [2021-03-24 10:42:05,231 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 116 transitions, 244 flow [2021-03-24 10:42:05,232 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-24 10:42:05,237 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 116 transitions, 244 flow [2021-03-24 10:42:05,239 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 116 transitions, 244 flow [2021-03-24 10:42:05,240 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 116 transitions, 244 flow [2021-03-24 10:42:05,254 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-03-24 10:42:05,254 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 10:42:05,255 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-24 10:42:05,257 INFO L142 LiptonReduction]: Number of co-enabled transitions 2894 [2021-03-24 10:42:06,199 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-24 10:42:06,536 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-24 10:42:06,641 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-24 10:42:07,520 INFO L154 LiptonReduction]: Checked pairs total: 5670 [2021-03-24 10:42:07,520 INFO L156 LiptonReduction]: Total number of compositions: 75 [2021-03-24 10:42:07,522 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2291 [2021-03-24 10:42:07,526 INFO L129 PetriNetUnfolder]: 0/13 cut-off events. [2021-03-24 10:42:07,526 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 10:42:07,526 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:42:07,527 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:42:07,527 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:42:07,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:42:07,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1588435966, now seen corresponding path program 1 times [2021-03-24 10:42:07,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:42:07,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626471649] [2021-03-24 10:42:07,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:42:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:42:07,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:07,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:42:07,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:07,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:42:07,669 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-24 10:42:07,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626471649] [2021-03-24 10:42:07,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:42:07,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-24 10:42:07,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486907015] [2021-03-24 10:42:07,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-24 10:42:07,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:42:07,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-24 10:42:07,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-24 10:42:07,683 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 195 [2021-03-24 10:42:07,687 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 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-24 10:42:07,687 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:42:07,687 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 195 [2021-03-24 10:42:07,687 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:42:07,792 INFO L129 PetriNetUnfolder]: 133/385 cut-off events. [2021-03-24 10:42:07,793 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 10:42:07,795 INFO L84 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 385 events. 133/385 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2207 event pairs, 110 based on Foata normal form. 33/393 useless extension candidates. Maximal degree in co-relation 582. Up to 153 conditions per place. [2021-03-24 10:42:07,798 INFO L132 encePairwiseOnDemand]: 191/195 looper letters, 11 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2021-03-24 10:42:07,798 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 52 transitions, 142 flow [2021-03-24 10:42:07,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-24 10:42:07,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-24 10:42:07,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2021-03-24 10:42:07,812 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9145299145299145 [2021-03-24 10:42:07,812 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 535 transitions. [2021-03-24 10:42:07,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 535 transitions. [2021-03-24 10:42:07,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:42:07,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 535 transitions. [2021-03-24 10:42:07,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 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-24 10:42:07,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 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-24 10:42:07,825 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 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-24 10:42:07,826 INFO L185 Difference]: Start difference. First operand has 62 places, 50 transitions, 112 flow. Second operand 3 states and 535 transitions. [2021-03-24 10:42:07,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 52 transitions, 142 flow [2021-03-24 10:42:07,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 52 transitions, 138 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-24 10:42:07,829 INFO L241 Difference]: Finished difference. Result has 58 places, 47 transitions, 106 flow [2021-03-24 10:42:07,832 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2021-03-24 10:42:07,832 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2021-03-24 10:42:07,832 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 106 flow [2021-03-24 10:42:07,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 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-24 10:42:07,833 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:42:07,833 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, 1] [2021-03-24 10:42:07,833 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-24 10:42:07,834 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:42:07,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:42:07,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1813580090, now seen corresponding path program 1 times [2021-03-24 10:42:07,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:42:07,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917817038] [2021-03-24 10:42:07,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:42:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:42:07,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:07,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:42:07,946 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:07,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:42:07,951 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-24 10:42:07,952 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-24 10:42:07,961 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:42:07,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:42:07,965 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-24 10:42:07,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917817038] [2021-03-24 10:42:07,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:42:07,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-24 10:42:07,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037992777] [2021-03-24 10:42:07,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 10:42:07,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:42:07,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 10:42:07,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-24 10:42:07,975 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 195 [2021-03-24 10:42:07,976 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 159.0) internal successors, (795), 5 states have internal predecessors, (795), 0 states have call successors, (0), 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-24 10:42:07,976 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:42:07,976 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 195 [2021-03-24 10:42:07,976 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:42:08,201 INFO L129 PetriNetUnfolder]: 573/1429 cut-off events. [2021-03-24 10:42:08,201 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 10:42:08,203 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2353 conditions, 1429 events. 573/1429 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 11020 event pairs, 61 based on Foata normal form. 64/1403 useless extension candidates. Maximal degree in co-relation 2331. Up to 449 conditions per place. [2021-03-24 10:42:08,207 INFO L132 encePairwiseOnDemand]: 183/195 looper letters, 14 selfloop transitions, 9 changer transitions 26/79 dead transitions. [2021-03-24 10:42:08,207 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 79 transitions, 260 flow [2021-03-24 10:42:08,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-24 10:42:08,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-24 10:42:08,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1154 transitions. [2021-03-24 10:42:08,209 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8454212454212454 [2021-03-24 10:42:08,209 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1154 transitions. [2021-03-24 10:42:08,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1154 transitions. [2021-03-24 10:42:08,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:42:08,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1154 transitions. [2021-03-24 10:42:08,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 164.85714285714286) internal successors, (1154), 7 states have internal predecessors, (1154), 0 states have call successors, (0), 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-24 10:42:08,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 0 states have call successors, (0), 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-24 10:42:08,214 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 0 states have call successors, (0), 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-24 10:42:08,214 INFO L185 Difference]: Start difference. First operand has 58 places, 47 transitions, 106 flow. Second operand 7 states and 1154 transitions. [2021-03-24 10:42:08,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 79 transitions, 260 flow [2021-03-24 10:42:08,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 79 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-24 10:42:08,216 INFO L241 Difference]: Finished difference. Result has 68 places, 48 transitions, 174 flow [2021-03-24 10:42:08,216 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=174, PETRI_PLACES=68, PETRI_TRANSITIONS=48} [2021-03-24 10:42:08,216 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 6 predicate places. [2021-03-24 10:42:08,216 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 48 transitions, 174 flow [2021-03-24 10:42:08,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 159.0) internal successors, (795), 5 states have internal predecessors, (795), 0 states have call successors, (0), 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-24 10:42:08,217 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:42:08,217 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, 1, 1, 1] [2021-03-24 10:42:08,217 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-24 10:42:08,217 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:42:08,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:42:08,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1793169978, now seen corresponding path program 1 times [2021-03-24 10:42:08,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:42:08,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817675551] [2021-03-24 10:42:08,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:42:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:42:08,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:08,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:42:08,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:08,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:42:08,290 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-24 10:42:08,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-24 10:42:08,302 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:42:08,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:42:08,304 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-24 10:42:08,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817675551] [2021-03-24 10:42:08,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:42:08,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-24 10:42:08,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628634089] [2021-03-24 10:42:08,305 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 10:42:08,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:42:08,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 10:42:08,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-24 10:42:08,307 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 195 [2021-03-24 10:42:08,308 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 48 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 159.2) internal successors, (796), 5 states have internal predecessors, (796), 0 states have call successors, (0), 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-24 10:42:08,308 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:42:08,308 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 195 [2021-03-24 10:42:08,308 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:42:08,408 INFO L129 PetriNetUnfolder]: 233/625 cut-off events. [2021-03-24 10:42:08,409 INFO L130 PetriNetUnfolder]: For 635/837 co-relation queries the response was YES. [2021-03-24 10:42:08,410 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1860 conditions, 625 events. 233/625 cut-off events. For 635/837 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3882 event pairs, 87 based on Foata normal form. 50/661 useless extension candidates. Maximal degree in co-relation 1830. Up to 298 conditions per place. [2021-03-24 10:42:08,412 INFO L132 encePairwiseOnDemand]: 186/195 looper letters, 18 selfloop transitions, 11 changer transitions 17/76 dead transitions. [2021-03-24 10:42:08,412 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 76 transitions, 436 flow [2021-03-24 10:42:08,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-24 10:42:08,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-24 10:42:08,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1143 transitions. [2021-03-24 10:42:08,414 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8373626373626374 [2021-03-24 10:42:08,414 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1143 transitions. [2021-03-24 10:42:08,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1143 transitions. [2021-03-24 10:42:08,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:42:08,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1143 transitions. [2021-03-24 10:42:08,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 163.28571428571428) internal successors, (1143), 7 states have internal predecessors, (1143), 0 states have call successors, (0), 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-24 10:42:08,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 0 states have call successors, (0), 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-24 10:42:08,419 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 0 states have call successors, (0), 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-24 10:42:08,419 INFO L185 Difference]: Start difference. First operand has 68 places, 48 transitions, 174 flow. Second operand 7 states and 1143 transitions. [2021-03-24 10:42:08,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 76 transitions, 436 flow [2021-03-24 10:42:08,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 76 transitions, 424 flow, removed 4 selfloop flow, removed 2 redundant places. [2021-03-24 10:42:08,424 INFO L241 Difference]: Finished difference. Result has 70 places, 55 transitions, 281 flow [2021-03-24 10:42:08,425 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=281, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2021-03-24 10:42:08,425 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 8 predicate places. [2021-03-24 10:42:08,425 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 281 flow [2021-03-24 10:42:08,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 159.2) internal successors, (796), 5 states have internal predecessors, (796), 0 states have call successors, (0), 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-24 10:42:08,425 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:42:08,425 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, 1, 1, 1, 1, 1] [2021-03-24 10:42:08,425 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-24 10:42:08,425 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:42:08,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:42:08,426 INFO L82 PathProgramCache]: Analyzing trace with hash 879866201, now seen corresponding path program 1 times [2021-03-24 10:42:08,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:42:08,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167252326] [2021-03-24 10:42:08,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:42:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:42:08,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:08,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:42:08,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:08,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:42:08,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:08,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:42:08,499 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-24 10:42:08,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167252326] [2021-03-24 10:42:08,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:42:08,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-24 10:42:08,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667309455] [2021-03-24 10:42:08,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-24 10:42:08,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:42:08,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-24 10:42:08,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-24 10:42:08,501 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 195 [2021-03-24 10:42:08,501 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 281 flow. Second operand has 4 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 0 states have call successors, (0), 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-24 10:42:08,501 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:42:08,501 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 195 [2021-03-24 10:42:08,501 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:42:08,694 INFO L129 PetriNetUnfolder]: 976/1881 cut-off events. [2021-03-24 10:42:08,695 INFO L130 PetriNetUnfolder]: For 1094/1192 co-relation queries the response was YES. [2021-03-24 10:42:08,701 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4554 conditions, 1881 events. 976/1881 cut-off events. For 1094/1192 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 14408 event pairs, 495 based on Foata normal form. 118/1650 useless extension candidates. Maximal degree in co-relation 4520. Up to 1175 conditions per place. [2021-03-24 10:42:08,708 INFO L132 encePairwiseOnDemand]: 188/195 looper letters, 12 selfloop transitions, 10 changer transitions 0/69 dead transitions. [2021-03-24 10:42:08,708 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 69 transitions, 353 flow [2021-03-24 10:42:08,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 10:42:08,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 10:42:08,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 834 transitions. [2021-03-24 10:42:08,711 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8553846153846154 [2021-03-24 10:42:08,711 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 834 transitions. [2021-03-24 10:42:08,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 834 transitions. [2021-03-24 10:42:08,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:42:08,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 834 transitions. [2021-03-24 10:42:08,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 166.8) internal successors, (834), 5 states have internal predecessors, (834), 0 states have call successors, (0), 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-24 10:42:08,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 0 states have call successors, (0), 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-24 10:42:08,715 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 0 states have call successors, (0), 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-24 10:42:08,716 INFO L185 Difference]: Start difference. First operand has 70 places, 55 transitions, 281 flow. Second operand 5 states and 834 transitions. [2021-03-24 10:42:08,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 69 transitions, 353 flow [2021-03-24 10:42:08,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 69 transitions, 340 flow, removed 5 selfloop flow, removed 3 redundant places. [2021-03-24 10:42:08,722 INFO L241 Difference]: Finished difference. Result has 71 places, 64 transitions, 343 flow [2021-03-24 10:42:08,723 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=343, PETRI_PLACES=71, PETRI_TRANSITIONS=64} [2021-03-24 10:42:08,723 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 9 predicate places. [2021-03-24 10:42:08,723 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 64 transitions, 343 flow [2021-03-24 10:42:08,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 0 states have call successors, (0), 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-24 10:42:08,723 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:42:08,723 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:42:08,723 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-24 10:42:08,723 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:42:08,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:42:08,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1972334554, now seen corresponding path program 1 times [2021-03-24 10:42:08,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:42:08,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938537106] [2021-03-24 10:42:08,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:42:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:42:08,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:08,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:42:08,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:08,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:42:08,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:08,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:42:08,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:08,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:42:08,791 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-24 10:42:08,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938537106] [2021-03-24 10:42:08,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:42:08,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-24 10:42:08,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481666914] [2021-03-24 10:42:08,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 10:42:08,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:42:08,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 10:42:08,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-24 10:42:08,793 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 195 [2021-03-24 10:42:08,793 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 64 transitions, 343 flow. Second operand has 5 states, 5 states have (on average 162.8) internal successors, (814), 5 states have internal predecessors, (814), 0 states have call successors, (0), 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-24 10:42:08,793 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:42:08,794 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 195 [2021-03-24 10:42:08,794 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:42:08,969 INFO L129 PetriNetUnfolder]: 760/1592 cut-off events. [2021-03-24 10:42:08,969 INFO L130 PetriNetUnfolder]: For 1988/4113 co-relation queries the response was YES. [2021-03-24 10:42:08,977 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5771 conditions, 1592 events. 760/1592 cut-off events. For 1988/4113 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 12183 event pairs, 136 based on Foata normal form. 415/1821 useless extension candidates. Maximal degree in co-relation 5735. Up to 1033 conditions per place. [2021-03-24 10:42:08,983 INFO L132 encePairwiseOnDemand]: 188/195 looper letters, 13 selfloop transitions, 19 changer transitions 0/79 dead transitions. [2021-03-24 10:42:08,983 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 79 transitions, 487 flow [2021-03-24 10:42:08,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-24 10:42:08,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-24 10:42:08,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1168 transitions. [2021-03-24 10:42:08,986 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8556776556776556 [2021-03-24 10:42:08,986 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1168 transitions. [2021-03-24 10:42:08,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1168 transitions. [2021-03-24 10:42:08,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:42:08,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1168 transitions. [2021-03-24 10:42:08,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 166.85714285714286) internal successors, (1168), 7 states have internal predecessors, (1168), 0 states have call successors, (0), 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-24 10:42:08,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 0 states have call successors, (0), 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-24 10:42:08,990 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 0 states have call successors, (0), 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-24 10:42:08,990 INFO L185 Difference]: Start difference. First operand has 71 places, 64 transitions, 343 flow. Second operand 7 states and 1168 transitions. [2021-03-24 10:42:08,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 79 transitions, 487 flow [2021-03-24 10:42:08,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 79 transitions, 476 flow, removed 3 selfloop flow, removed 3 redundant places. [2021-03-24 10:42:08,996 INFO L241 Difference]: Finished difference. Result has 77 places, 73 transitions, 466 flow [2021-03-24 10:42:08,996 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=466, PETRI_PLACES=77, PETRI_TRANSITIONS=73} [2021-03-24 10:42:08,996 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 15 predicate places. [2021-03-24 10:42:08,996 INFO L480 AbstractCegarLoop]: Abstraction has has 77 places, 73 transitions, 466 flow [2021-03-24 10:42:08,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 162.8) internal successors, (814), 5 states have internal predecessors, (814), 0 states have call successors, (0), 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-24 10:42:08,996 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:42:08,996 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:42:08,997 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-24 10:42:08,997 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:42:08,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:42:08,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1859918922, now seen corresponding path program 1 times [2021-03-24 10:42:08,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:42:08,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091330199] [2021-03-24 10:42:08,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:42:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:42:09,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:09,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:42:09,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:09,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:42:09,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:09,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:42:09,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:09,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:42:09,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:09,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:42:09,104 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-24 10:42:09,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091330199] [2021-03-24 10:42:09,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:42:09,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-24 10:42:09,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029153723] [2021-03-24 10:42:09,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-24 10:42:09,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:42:09,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-24 10:42:09,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-24 10:42:09,105 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 195 [2021-03-24 10:42:09,106 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 73 transitions, 466 flow. Second operand has 6 states, 6 states have (on average 162.83333333333334) internal successors, (977), 6 states have internal predecessors, (977), 0 states have call successors, (0), 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-24 10:42:09,106 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:42:09,106 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 195 [2021-03-24 10:42:09,106 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:42:09,287 INFO L129 PetriNetUnfolder]: 644/1378 cut-off events. [2021-03-24 10:42:09,287 INFO L130 PetriNetUnfolder]: For 4643/9333 co-relation queries the response was YES. [2021-03-24 10:42:09,295 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6747 conditions, 1378 events. 644/1378 cut-off events. For 4643/9333 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 10383 event pairs, 47 based on Foata normal form. 615/1819 useless extension candidates. Maximal degree in co-relation 6709. Up to 966 conditions per place. [2021-03-24 10:42:09,301 INFO L132 encePairwiseOnDemand]: 188/195 looper letters, 10 selfloop transitions, 28 changer transitions 4/89 dead transitions. [2021-03-24 10:42:09,301 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 89 transitions, 682 flow [2021-03-24 10:42:09,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-24 10:42:09,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-24 10:42:09,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1502 transitions. [2021-03-24 10:42:09,304 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8558404558404559 [2021-03-24 10:42:09,304 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1502 transitions. [2021-03-24 10:42:09,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1502 transitions. [2021-03-24 10:42:09,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:42:09,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1502 transitions. [2021-03-24 10:42:09,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 166.88888888888889) internal successors, (1502), 9 states have internal predecessors, (1502), 0 states have call successors, (0), 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-24 10:42:09,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 195.0) internal successors, (1950), 10 states have internal predecessors, (1950), 0 states have call successors, (0), 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-24 10:42:09,310 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 195.0) internal successors, (1950), 10 states have internal predecessors, (1950), 0 states have call successors, (0), 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-24 10:42:09,310 INFO L185 Difference]: Start difference. First operand has 77 places, 73 transitions, 466 flow. Second operand 9 states and 1502 transitions. [2021-03-24 10:42:09,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 89 transitions, 682 flow [2021-03-24 10:42:09,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 89 transitions, 632 flow, removed 17 selfloop flow, removed 3 redundant places. [2021-03-24 10:42:09,334 INFO L241 Difference]: Finished difference. Result has 85 places, 82 transitions, 594 flow [2021-03-24 10:42:09,335 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=594, PETRI_PLACES=85, PETRI_TRANSITIONS=82} [2021-03-24 10:42:09,335 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 23 predicate places. [2021-03-24 10:42:09,335 INFO L480 AbstractCegarLoop]: Abstraction has has 85 places, 82 transitions, 594 flow [2021-03-24 10:42:09,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 162.83333333333334) internal successors, (977), 6 states have internal predecessors, (977), 0 states have call successors, (0), 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-24 10:42:09,335 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:42:09,335 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:42:09,335 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-24 10:42:09,335 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:42:09,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:42:09,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1887354269, now seen corresponding path program 1 times [2021-03-24 10:42:09,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:42:09,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926943101] [2021-03-24 10:42:09,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:42:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:42:09,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:09,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:42:09,433 INFO L142 QuantifierPusher]: treesize reduction 4, result has 85.2 percent of original size [2021-03-24 10:42:09,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-24 10:42:09,445 INFO L142 QuantifierPusher]: treesize reduction 17, result has 70.2 percent of original size [2021-03-24 10:42:09,448 INFO L147 QuantifierPusher]: treesize reduction 9, result has 77.5 percent of original size 31 [2021-03-24 10:42:09,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:09,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:42:09,485 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:42:09,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:42:09,488 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-24 10:42:09,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926943101] [2021-03-24 10:42:09,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:42:09,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-24 10:42:09,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100637076] [2021-03-24 10:42:09,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-24 10:42:09,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:42:09,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-24 10:42:09,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-24 10:42:09,490 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 195 [2021-03-24 10:42:09,492 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 82 transitions, 594 flow. Second operand has 6 states, 6 states have (on average 158.83333333333334) internal successors, (953), 6 states have internal predecessors, (953), 0 states have call successors, (0), 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-24 10:42:09,492 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:42:09,492 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 195 [2021-03-24 10:42:09,492 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:42:09,986 INFO L129 PetriNetUnfolder]: 1506/3666 cut-off events. [2021-03-24 10:42:09,986 INFO L130 PetriNetUnfolder]: For 15586/18328 co-relation queries the response was YES. [2021-03-24 10:42:10,008 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15896 conditions, 3666 events. 1506/3666 cut-off events. For 15586/18328 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 35795 event pairs, 172 based on Foata normal form. 281/3655 useless extension candidates. Maximal degree in co-relation 15853. Up to 1449 conditions per place. [2021-03-24 10:42:10,026 INFO L132 encePairwiseOnDemand]: 186/195 looper letters, 20 selfloop transitions, 19 changer transitions 5/112 dead transitions. [2021-03-24 10:42:10,026 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 112 transitions, 842 flow [2021-03-24 10:42:10,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-24 10:42:10,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-24 10:42:10,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1138 transitions. [2021-03-24 10:42:10,029 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8336996336996337 [2021-03-24 10:42:10,029 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1138 transitions. [2021-03-24 10:42:10,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1138 transitions. [2021-03-24 10:42:10,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:42:10,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1138 transitions. [2021-03-24 10:42:10,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 162.57142857142858) internal successors, (1138), 7 states have internal predecessors, (1138), 0 states have call successors, (0), 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-24 10:42:10,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 0 states have call successors, (0), 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-24 10:42:10,032 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 0 states have call successors, (0), 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-24 10:42:10,033 INFO L185 Difference]: Start difference. First operand has 85 places, 82 transitions, 594 flow. Second operand 7 states and 1138 transitions. [2021-03-24 10:42:10,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 112 transitions, 842 flow [2021-03-24 10:42:10,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 112 transitions, 745 flow, removed 34 selfloop flow, removed 4 redundant places. [2021-03-24 10:42:10,474 INFO L241 Difference]: Finished difference. Result has 92 places, 103 transitions, 693 flow [2021-03-24 10:42:10,474 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=693, PETRI_PLACES=92, PETRI_TRANSITIONS=103} [2021-03-24 10:42:10,474 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 30 predicate places. [2021-03-24 10:42:10,474 INFO L480 AbstractCegarLoop]: Abstraction has has 92 places, 103 transitions, 693 flow [2021-03-24 10:42:10,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 158.83333333333334) internal successors, (953), 6 states have internal predecessors, (953), 0 states have call successors, (0), 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-24 10:42:10,475 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:42:10,475 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:42:10,475 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-24 10:42:10,475 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:42:10,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:42:10,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1013463965, now seen corresponding path program 2 times [2021-03-24 10:42:10,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:42:10,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394547438] [2021-03-24 10:42:10,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:42:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:42:10,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:10,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:42:10,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:10,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:42:10,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:10,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 10:42:10,555 INFO L142 QuantifierPusher]: treesize reduction 4, result has 88.9 percent of original size [2021-03-24 10:42:10,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-24 10:42:10,570 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:10,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-24 10:42:10,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:10,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 10:42:10,585 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-24 10:42:10,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-24 10:42:10,598 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:42:10,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:42:10,604 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-24 10:42:10,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394547438] [2021-03-24 10:42:10,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:42:10,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-24 10:42:10,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010768623] [2021-03-24 10:42:10,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-24 10:42:10,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:42:10,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-24 10:42:10,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-03-24 10:42:10,606 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 195 [2021-03-24 10:42:10,607 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 103 transitions, 693 flow. Second operand has 9 states, 9 states have (on average 134.33333333333334) internal successors, (1209), 9 states have internal predecessors, (1209), 0 states have call successors, (0), 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-24 10:42:10,607 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:42:10,607 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 195 [2021-03-24 10:42:10,607 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:42:11,418 INFO L129 PetriNetUnfolder]: 2927/6264 cut-off events. [2021-03-24 10:42:11,419 INFO L130 PetriNetUnfolder]: For 31166/35233 co-relation queries the response was YES. [2021-03-24 10:42:11,451 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24515 conditions, 6264 events. 2927/6264 cut-off events. For 31166/35233 co-relation queries the response was YES. Maximal size of possible extension queue 754. Compared 60503 event pairs, 202 based on Foata normal form. 677/6438 useless extension candidates. Maximal degree in co-relation 24462. Up to 1405 conditions per place. [2021-03-24 10:42:11,474 INFO L132 encePairwiseOnDemand]: 179/195 looper letters, 67 selfloop transitions, 75 changer transitions 17/205 dead transitions. [2021-03-24 10:42:11,474 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 205 transitions, 1762 flow [2021-03-24 10:42:11,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-24 10:42:11,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-03-24 10:42:11,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1675 transitions. [2021-03-24 10:42:11,477 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7158119658119658 [2021-03-24 10:42:11,477 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1675 transitions. [2021-03-24 10:42:11,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1675 transitions. [2021-03-24 10:42:11,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:42:11,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1675 transitions. [2021-03-24 10:42:11,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 139.58333333333334) internal successors, (1675), 12 states have internal predecessors, (1675), 0 states have call successors, (0), 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-24 10:42:11,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 195.0) internal successors, (2535), 13 states have internal predecessors, (2535), 0 states have call successors, (0), 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-24 10:42:11,484 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 195.0) internal successors, (2535), 13 states have internal predecessors, (2535), 0 states have call successors, (0), 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-24 10:42:11,484 INFO L185 Difference]: Start difference. First operand has 92 places, 103 transitions, 693 flow. Second operand 12 states and 1675 transitions. [2021-03-24 10:42:11,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 205 transitions, 1762 flow [2021-03-24 10:42:12,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 205 transitions, 1752 flow, removed 5 selfloop flow, removed 1 redundant places. [2021-03-24 10:42:12,146 INFO L241 Difference]: Finished difference. Result has 108 places, 153 transitions, 1450 flow [2021-03-24 10:42:12,146 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1450, PETRI_PLACES=108, PETRI_TRANSITIONS=153} [2021-03-24 10:42:12,146 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 46 predicate places. [2021-03-24 10:42:12,146 INFO L480 AbstractCegarLoop]: Abstraction has has 108 places, 153 transitions, 1450 flow [2021-03-24 10:42:12,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 134.33333333333334) internal successors, (1209), 9 states have internal predecessors, (1209), 0 states have call successors, (0), 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-24 10:42:12,147 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:42:12,147 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:42:12,147 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-24 10:42:12,147 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:42:12,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:42:12,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1744998987, now seen corresponding path program 3 times [2021-03-24 10:42:12,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:42:12,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146367166] [2021-03-24 10:42:12,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:42:12,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:42:12,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:12,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:42:12,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:12,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:42:12,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:12,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:42:12,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:12,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:42:12,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:12,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:42:12,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:12,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:42:12,213 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-24 10:42:12,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146367166] [2021-03-24 10:42:12,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:42:12,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-24 10:42:12,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292931411] [2021-03-24 10:42:12,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-24 10:42:12,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:42:12,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-24 10:42:12,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-24 10:42:12,215 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 195 [2021-03-24 10:42:12,216 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 153 transitions, 1450 flow. Second operand has 7 states, 7 states have (on average 162.85714285714286) internal successors, (1140), 7 states have internal predecessors, (1140), 0 states have call successors, (0), 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-24 10:42:12,216 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:42:12,216 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 195 [2021-03-24 10:42:12,216 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:42:12,898 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L811-->L818: Formula: (let ((.cse12 (= (mod v_~a$w_buff1_used~0_378 256) 0)) (.cse5 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse3 (= (mod v_~a$w_buff0_used~0_457 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse14 (= (mod v_~a$w_buff0_used~0_458 256) 0))) (let ((.cse8 (not .cse14)) (.cse9 (or .cse13 .cse14)) (.cse2 (or .cse13 .cse3)) (.cse11 (or .cse12 .cse5)) (.cse0 (not .cse13)) (.cse1 (not .cse3)) (.cse10 (not .cse12)) (.cse7 (not .cse5))) (and (or (and .cse0 (= v_~a$r_buff0_thd3~0_67 0) .cse1) (and .cse2 (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67))) (let ((.cse4 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse6 (= 0 (mod v_~a$w_buff1_used~0_377 256)))) (or (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse3 .cse4) (or .cse5 .cse6)) (and (or (and (not .cse4) .cse1) (and .cse7 (not .cse6))) (= v_~a$r_buff1_thd3~0_51 0)))) (or (and .cse0 (= v_~a~0_162 v_~a$w_buff0~0_99) (= |v_P2_#t~ite17_47| |v_P2Thread1of1ForFork3_#t~ite17_1|) .cse8) (and (= |v_P2_#t~ite17_47| v_~a~0_162) .cse9 (or (and .cse10 .cse7 (= |v_P2_#t~ite17_47| v_~a$w_buff1~0_118)) (and (= |v_P2_#t~ite17_47| v_~a~0_163) .cse11)))) (or (and .cse0 (= v_~a$w_buff0_used~0_457 0) .cse8) (and .cse9 (= v_~a$w_buff0_used~0_458 v_~a$w_buff0_used~0_457))) (or (and (= v_~a$w_buff1_used~0_378 v_~a$w_buff1_used~0_377) .cse2 .cse11) (and (= v_~a$w_buff1_used~0_377 0) (or (and .cse0 .cse1) (and .cse10 .cse7))))))) InVars {~a~0=v_~a~0_163, ~a$w_buff1~0=v_~a$w_buff1~0_118, ~a$w_buff0~0=v_~a$w_buff0~0_99, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_458, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_378, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_1|} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_457, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork3_#t~ite22=|v_P2Thread1of1ForFork3_#t~ite22_1|, ~a~0=v_~a~0_162, ~a$w_buff1~0=v_~a$w_buff1~0_118, ~a$w_buff0~0=v_~a$w_buff0~0_99, P2Thread1of1ForFork3_#t~ite20=|v_P2Thread1of1ForFork3_#t~ite20_1|, P2Thread1of1ForFork3_#t~ite21=|v_P2Thread1of1ForFork3_#t~ite21_1|, P2Thread1of1ForFork3_#t~ite19=|v_P2Thread1of1ForFork3_#t~ite19_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_377, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_2|, P2Thread1of1ForFork3_#t~ite18=|v_P2Thread1of1ForFork3_#t~ite18_1|} AuxVars[|v_P2_#t~ite17_47|] AssignedVars[P2Thread1of1ForFork3_#t~ite22, ~a~0, P2Thread1of1ForFork3_#t~ite20, ~a$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite21, P2Thread1of1ForFork3_#t~ite19, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0, P2Thread1of1ForFork3_#t~ite17, P2Thread1of1ForFork3_#t~ite18][109], [Black: 185#(= ULTIMATE.start_assume_abort_if_not_~cond 0), Black: 248#(and (= ~a$r_buff0_thd4~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0)) (= ~a$r_buff0_thd2~0 0)), P1Thread1of1ForFork2InUse, Black: 189#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), Black: 250#(and (= ~a$r_buff0_thd4~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0)) (= ~a$r_buff0_thd2~0 0)), P3Thread1of1ForFork0InUse, Black: 238#(and (= ~a$r_buff0_thd4~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0))) (= ~a$r_buff0_thd2~0 0)), P2Thread1of1ForFork3InUse, 261#(<= ~__unbuffered_cnt~0 0), P0Thread1of1ForFork1InUse, 139#true, 77#L854true, Black: 198#(<= ~__unbuffered_cnt~0 2), Black: 199#(= ULTIMATE.start_assume_abort_if_not_~cond 0), Black: 205#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 2)), 210#true, Black: 147#(and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0))), 87#L878-1true, Black: 141#(= ~__unbuffered_p3_EAX~0 0), Black: 142#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0))), 155#true, Black: 212#(and (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), 30#L818true, Black: 213#(and (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1)), Black: 214#(= ~__unbuffered_p3_EBX~0 1), Black: 217#(and (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1)), 229#(and (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff0_thd2~0 0)), 38#L798true, Black: 157#(= ~__unbuffered_p1_EAX~0 0), Black: 158#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0))), 173#(<= ~__unbuffered_cnt~0 0), 114#L775true, Black: 176#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 0)), Black: 174#(= ULTIMATE.start_assume_abort_if_not_~cond 0), Black: 240#(and (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 242#(and (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0))) (= ~a$r_buff0_thd2~0 0)), Black: 244#(and (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 246#(and (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff0_thd2~0 0)), Black: 184#(<= ~__unbuffered_cnt~0 1)]) [2021-03-24 10:42:12,898 INFO L384 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2021-03-24 10:42:12,899 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-24 10:42:12,899 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-24 10:42:12,899 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-24 10:42:13,320 INFO L129 PetriNetUnfolder]: 4083/8201 cut-off events. [2021-03-24 10:42:13,320 INFO L130 PetriNetUnfolder]: For 42891/68268 co-relation queries the response was YES. [2021-03-24 10:42:13,365 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35049 conditions, 8201 events. 4083/8201 cut-off events. For 42891/68268 co-relation queries the response was YES. Maximal size of possible extension queue 1095. Compared 79079 event pairs, 119 based on Foata normal form. 4440/11578 useless extension candidates. Maximal degree in co-relation 35013. Up to 1891 conditions per place. [2021-03-24 10:42:13,436 INFO L132 encePairwiseOnDemand]: 188/195 looper letters, 7 selfloop transitions, 33 changer transitions 8/158 dead transitions. [2021-03-24 10:42:13,436 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 158 transitions, 1534 flow [2021-03-24 10:42:13,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-24 10:42:13,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-24 10:42:13,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1828 transitions. [2021-03-24 10:42:13,440 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8522144522144522 [2021-03-24 10:42:13,440 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1828 transitions. [2021-03-24 10:42:13,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1828 transitions. [2021-03-24 10:42:13,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:42:13,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1828 transitions. [2021-03-24 10:42:13,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 166.1818181818182) internal successors, (1828), 11 states have internal predecessors, (1828), 0 states have call successors, (0), 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-24 10:42:13,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 195.0) internal successors, (2340), 12 states have internal predecessors, (2340), 0 states have call successors, (0), 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-24 10:42:13,446 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 195.0) internal successors, (2340), 12 states have internal predecessors, (2340), 0 states have call successors, (0), 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-24 10:42:13,446 INFO L185 Difference]: Start difference. First operand has 108 places, 153 transitions, 1450 flow. Second operand 11 states and 1828 transitions. [2021-03-24 10:42:13,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 158 transitions, 1534 flow [2021-03-24 10:42:14,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 158 transitions, 1455 flow, removed 29 selfloop flow, removed 7 redundant places. [2021-03-24 10:42:14,223 INFO L241 Difference]: Finished difference. Result has 112 places, 147 transitions, 1332 flow [2021-03-24 10:42:14,223 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=1295, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1332, PETRI_PLACES=112, PETRI_TRANSITIONS=147} [2021-03-24 10:42:14,223 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 50 predicate places. [2021-03-24 10:42:14,223 INFO L480 AbstractCegarLoop]: Abstraction has has 112 places, 147 transitions, 1332 flow [2021-03-24 10:42:14,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 162.85714285714286) internal successors, (1140), 7 states have internal predecessors, (1140), 0 states have call successors, (0), 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-24 10:42:14,224 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:42:14,224 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:42:14,224 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-24 10:42:14,224 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:42:14,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:42:14,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1457838748, now seen corresponding path program 1 times [2021-03-24 10:42:14,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:42:14,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559089760] [2021-03-24 10:42:14,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:42:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:42:14,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:14,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:42:14,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:14,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:42:14,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:14,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:42:14,264 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:42:14,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:42:14,268 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-24 10:42:14,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559089760] [2021-03-24 10:42:14,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:42:14,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-24 10:42:14,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724244275] [2021-03-24 10:42:14,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 10:42:14,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:42:14,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 10:42:14,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-24 10:42:14,269 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 195 [2021-03-24 10:42:14,270 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 147 transitions, 1332 flow. Second operand has 5 states, 5 states have (on average 173.4) internal successors, (867), 5 states have internal predecessors, (867), 0 states have call successors, (0), 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-24 10:42:14,270 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:42:14,270 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 195 [2021-03-24 10:42:14,270 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:42:14,999 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L811-->L818: Formula: (let ((.cse12 (= (mod v_~a$w_buff1_used~0_378 256) 0)) (.cse5 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse3 (= (mod v_~a$w_buff0_used~0_457 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse14 (= (mod v_~a$w_buff0_used~0_458 256) 0))) (let ((.cse8 (not .cse14)) (.cse9 (or .cse13 .cse14)) (.cse2 (or .cse13 .cse3)) (.cse11 (or .cse12 .cse5)) (.cse0 (not .cse13)) (.cse1 (not .cse3)) (.cse10 (not .cse12)) (.cse7 (not .cse5))) (and (or (and .cse0 (= v_~a$r_buff0_thd3~0_67 0) .cse1) (and .cse2 (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67))) (let ((.cse4 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse6 (= 0 (mod v_~a$w_buff1_used~0_377 256)))) (or (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse3 .cse4) (or .cse5 .cse6)) (and (or (and (not .cse4) .cse1) (and .cse7 (not .cse6))) (= v_~a$r_buff1_thd3~0_51 0)))) (or (and .cse0 (= v_~a~0_162 v_~a$w_buff0~0_99) (= |v_P2_#t~ite17_47| |v_P2Thread1of1ForFork3_#t~ite17_1|) .cse8) (and (= |v_P2_#t~ite17_47| v_~a~0_162) .cse9 (or (and .cse10 .cse7 (= |v_P2_#t~ite17_47| v_~a$w_buff1~0_118)) (and (= |v_P2_#t~ite17_47| v_~a~0_163) .cse11)))) (or (and .cse0 (= v_~a$w_buff0_used~0_457 0) .cse8) (and .cse9 (= v_~a$w_buff0_used~0_458 v_~a$w_buff0_used~0_457))) (or (and (= v_~a$w_buff1_used~0_378 v_~a$w_buff1_used~0_377) .cse2 .cse11) (and (= v_~a$w_buff1_used~0_377 0) (or (and .cse0 .cse1) (and .cse10 .cse7))))))) InVars {~a~0=v_~a~0_163, ~a$w_buff1~0=v_~a$w_buff1~0_118, ~a$w_buff0~0=v_~a$w_buff0~0_99, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_458, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_378, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_1|} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_457, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork3_#t~ite22=|v_P2Thread1of1ForFork3_#t~ite22_1|, ~a~0=v_~a~0_162, ~a$w_buff1~0=v_~a$w_buff1~0_118, ~a$w_buff0~0=v_~a$w_buff0~0_99, P2Thread1of1ForFork3_#t~ite20=|v_P2Thread1of1ForFork3_#t~ite20_1|, P2Thread1of1ForFork3_#t~ite21=|v_P2Thread1of1ForFork3_#t~ite21_1|, P2Thread1of1ForFork3_#t~ite19=|v_P2Thread1of1ForFork3_#t~ite19_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_377, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_2|, P2Thread1of1ForFork3_#t~ite18=|v_P2Thread1of1ForFork3_#t~ite18_1|} AuxVars[|v_P2_#t~ite17_47|] AssignedVars[P2Thread1of1ForFork3_#t~ite22, ~a~0, P2Thread1of1ForFork3_#t~ite20, ~a$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite21, P2Thread1of1ForFork3_#t~ite19, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0, P2Thread1of1ForFork3_#t~ite17, P2Thread1of1ForFork3_#t~ite18][117], [P1Thread1of1ForFork2InUse, Black: 185#(= ULTIMATE.start_assume_abort_if_not_~cond 0), Black: 189#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), Black: 238#(and (= ~a$r_buff0_thd4~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0))) (= ~a$r_buff0_thd2~0 0)), P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 261#(<= ~__unbuffered_cnt~0 0), P0Thread1of1ForFork1InUse, 139#true, 77#L854true, Black: 198#(<= ~__unbuffered_cnt~0 2), Black: 199#(= ULTIMATE.start_assume_abort_if_not_~cond 0), Black: 205#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 2)), 210#true, Black: 273#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 3)), Black: 264#(<= ~__unbuffered_cnt~0 3), Black: 265#(= ULTIMATE.start_assume_abort_if_not_~cond 0), Black: 147#(and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0))), 87#L878-1true, Black: 142#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0))), 155#true, 284#(and (= ~__unbuffered_p2_EAX~0 1) (= ~z~0 1)), Black: 212#(and (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), 30#L818true, Black: 213#(and (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1)), Black: 214#(= ~__unbuffered_p3_EBX~0 1), Black: 217#(and (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1)), 229#(and (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff0_thd2~0 0)), 38#L798true, Black: 158#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0))), 173#(<= ~__unbuffered_cnt~0 0), 114#L775true, Black: 176#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 0)), Black: 174#(= ULTIMATE.start_assume_abort_if_not_~cond 0), Black: 240#(and (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 242#(and (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0))) (= ~a$r_buff0_thd2~0 0)), Black: 244#(and (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 246#(and (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff0_thd2~0 0)), Black: 184#(<= ~__unbuffered_cnt~0 1)]) [2021-03-24 10:42:15,000 INFO L384 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2021-03-24 10:42:15,000 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-24 10:42:15,000 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-24 10:42:15,000 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-24 10:42:15,390 INFO L129 PetriNetUnfolder]: 5012/11049 cut-off events. [2021-03-24 10:42:15,390 INFO L130 PetriNetUnfolder]: For 43209/48490 co-relation queries the response was YES. [2021-03-24 10:42:15,533 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50136 conditions, 11049 events. 5012/11049 cut-off events. For 43209/48490 co-relation queries the response was YES. Maximal size of possible extension queue 1586. Compared 120974 event pairs, 172 based on Foata normal form. 189/10239 useless extension candidates. Maximal degree in co-relation 50081. Up to 3027 conditions per place. [2021-03-24 10:42:15,555 INFO L132 encePairwiseOnDemand]: 191/195 looper letters, 23 selfloop transitions, 10 changer transitions 8/161 dead transitions. [2021-03-24 10:42:15,555 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 161 transitions, 1555 flow [2021-03-24 10:42:15,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 10:42:15,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 10:42:15,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 871 transitions. [2021-03-24 10:42:15,558 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8933333333333333 [2021-03-24 10:42:15,558 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 871 transitions. [2021-03-24 10:42:15,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 871 transitions. [2021-03-24 10:42:15,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:42:15,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 871 transitions. [2021-03-24 10:42:15,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 174.2) internal successors, (871), 5 states have internal predecessors, (871), 0 states have call successors, (0), 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-24 10:42:15,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 0 states have call successors, (0), 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-24 10:42:15,561 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 0 states have call successors, (0), 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-24 10:42:15,561 INFO L185 Difference]: Start difference. First operand has 112 places, 147 transitions, 1332 flow. Second operand 5 states and 871 transitions. [2021-03-24 10:42:15,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 161 transitions, 1555 flow [2021-03-24 10:42:17,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 161 transitions, 1414 flow, removed 40 selfloop flow, removed 11 redundant places. [2021-03-24 10:42:17,614 INFO L241 Difference]: Finished difference. Result has 107 places, 147 transitions, 1269 flow [2021-03-24 10:42:17,614 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=1197, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1269, PETRI_PLACES=107, PETRI_TRANSITIONS=147} [2021-03-24 10:42:17,614 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 45 predicate places. [2021-03-24 10:42:17,615 INFO L480 AbstractCegarLoop]: Abstraction has has 107 places, 147 transitions, 1269 flow [2021-03-24 10:42:17,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 173.4) internal successors, (867), 5 states have internal predecessors, (867), 0 states have call successors, (0), 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-24 10:42:17,615 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:42:17,615 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:42:17,615 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-24 10:42:17,615 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:42:17,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:42:17,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1891976250, now seen corresponding path program 2 times [2021-03-24 10:42:17,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:42:17,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724677761] [2021-03-24 10:42:17,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:42:17,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:42:17,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:17,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:42:17,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:17,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:42:17,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:17,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:42:17,659 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-24 10:42:17,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-24 10:42:17,669 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:42:17,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:42:17,673 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-24 10:42:17,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724677761] [2021-03-24 10:42:17,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:42:17,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-24 10:42:17,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65052396] [2021-03-24 10:42:17,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-24 10:42:17,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:42:17,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-24 10:42:17,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-24 10:42:17,675 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 195 [2021-03-24 10:42:17,676 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 147 transitions, 1269 flow. Second operand has 6 states, 6 states have (on average 157.16666666666666) internal successors, (943), 6 states have internal predecessors, (943), 0 states have call successors, (0), 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-24 10:42:17,676 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:42:17,676 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 195 [2021-03-24 10:42:17,676 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:42:18,384 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L811-->L818: Formula: (let ((.cse12 (= (mod v_~a$w_buff1_used~0_378 256) 0)) (.cse5 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse3 (= (mod v_~a$w_buff0_used~0_457 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse14 (= (mod v_~a$w_buff0_used~0_458 256) 0))) (let ((.cse8 (not .cse14)) (.cse9 (or .cse13 .cse14)) (.cse2 (or .cse13 .cse3)) (.cse11 (or .cse12 .cse5)) (.cse0 (not .cse13)) (.cse1 (not .cse3)) (.cse10 (not .cse12)) (.cse7 (not .cse5))) (and (or (and .cse0 (= v_~a$r_buff0_thd3~0_67 0) .cse1) (and .cse2 (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67))) (let ((.cse4 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse6 (= 0 (mod v_~a$w_buff1_used~0_377 256)))) (or (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse3 .cse4) (or .cse5 .cse6)) (and (or (and (not .cse4) .cse1) (and .cse7 (not .cse6))) (= v_~a$r_buff1_thd3~0_51 0)))) (or (and .cse0 (= v_~a~0_162 v_~a$w_buff0~0_99) (= |v_P2_#t~ite17_47| |v_P2Thread1of1ForFork3_#t~ite17_1|) .cse8) (and (= |v_P2_#t~ite17_47| v_~a~0_162) .cse9 (or (and .cse10 .cse7 (= |v_P2_#t~ite17_47| v_~a$w_buff1~0_118)) (and (= |v_P2_#t~ite17_47| v_~a~0_163) .cse11)))) (or (and .cse0 (= v_~a$w_buff0_used~0_457 0) .cse8) (and .cse9 (= v_~a$w_buff0_used~0_458 v_~a$w_buff0_used~0_457))) (or (and (= v_~a$w_buff1_used~0_378 v_~a$w_buff1_used~0_377) .cse2 .cse11) (and (= v_~a$w_buff1_used~0_377 0) (or (and .cse0 .cse1) (and .cse10 .cse7))))))) InVars {~a~0=v_~a~0_163, ~a$w_buff1~0=v_~a$w_buff1~0_118, ~a$w_buff0~0=v_~a$w_buff0~0_99, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_458, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_378, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_1|} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_457, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork3_#t~ite22=|v_P2Thread1of1ForFork3_#t~ite22_1|, ~a~0=v_~a~0_162, ~a$w_buff1~0=v_~a$w_buff1~0_118, ~a$w_buff0~0=v_~a$w_buff0~0_99, P2Thread1of1ForFork3_#t~ite20=|v_P2Thread1of1ForFork3_#t~ite20_1|, P2Thread1of1ForFork3_#t~ite21=|v_P2Thread1of1ForFork3_#t~ite21_1|, P2Thread1of1ForFork3_#t~ite19=|v_P2Thread1of1ForFork3_#t~ite19_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_377, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_2|, P2Thread1of1ForFork3_#t~ite18=|v_P2Thread1of1ForFork3_#t~ite18_1|} AuxVars[|v_P2_#t~ite17_47|] AssignedVars[P2Thread1of1ForFork3_#t~ite22, ~a~0, P2Thread1of1ForFork3_#t~ite20, ~a$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite21, P2Thread1of1ForFork3_#t~ite19, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0, P2Thread1of1ForFork3_#t~ite17, P2Thread1of1ForFork3_#t~ite18][140], [P1Thread1of1ForFork2InUse, Black: 185#(= ULTIMATE.start_assume_abort_if_not_~cond 0), Black: 189#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), Black: 238#(and (= ~a$r_buff0_thd4~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0))) (= ~a$r_buff0_thd2~0 0)), P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 139#true, 77#L854true, Black: 198#(<= ~__unbuffered_cnt~0 2), Black: 205#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 2)), 210#true, Black: 273#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 3)), Black: 264#(<= ~__unbuffered_cnt~0 3), 87#L878-1true, Black: 142#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0))), 155#true, 284#(and (= ~__unbuffered_p2_EAX~0 1) (= ~z~0 1)), Black: 212#(and (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), 30#L818true, Black: 213#(and (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1)), Black: 214#(= ~__unbuffered_p3_EBX~0 1), Black: 280#(= ~z~0 1), Black: 217#(and (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1)), Black: 286#(and (= ~__unbuffered_p2_EAX~0 1) (= ~z~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0))), 229#(and (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff0_thd2~0 0)), 293#(= ~y~0 1), 38#L798true, Black: 158#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0))), 173#(<= ~__unbuffered_cnt~0 0), 114#L775true, Black: 176#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 0)), Black: 174#(= ULTIMATE.start_assume_abort_if_not_~cond 0), Black: 240#(and (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 242#(and (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0))) (= ~a$r_buff0_thd2~0 0)), Black: 244#(and (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 246#(and (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff0_thd2~0 0)), Black: 184#(<= ~__unbuffered_cnt~0 1)]) [2021-03-24 10:42:18,385 INFO L384 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2021-03-24 10:42:18,385 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-24 10:42:18,385 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-24 10:42:18,385 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-24 10:42:18,442 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L811-->L818: Formula: (let ((.cse12 (= (mod v_~a$w_buff1_used~0_378 256) 0)) (.cse5 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse3 (= (mod v_~a$w_buff0_used~0_457 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse14 (= (mod v_~a$w_buff0_used~0_458 256) 0))) (let ((.cse8 (not .cse14)) (.cse9 (or .cse13 .cse14)) (.cse2 (or .cse13 .cse3)) (.cse11 (or .cse12 .cse5)) (.cse0 (not .cse13)) (.cse1 (not .cse3)) (.cse10 (not .cse12)) (.cse7 (not .cse5))) (and (or (and .cse0 (= v_~a$r_buff0_thd3~0_67 0) .cse1) (and .cse2 (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67))) (let ((.cse4 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse6 (= 0 (mod v_~a$w_buff1_used~0_377 256)))) (or (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse3 .cse4) (or .cse5 .cse6)) (and (or (and (not .cse4) .cse1) (and .cse7 (not .cse6))) (= v_~a$r_buff1_thd3~0_51 0)))) (or (and .cse0 (= v_~a~0_162 v_~a$w_buff0~0_99) (= |v_P2_#t~ite17_47| |v_P2Thread1of1ForFork3_#t~ite17_1|) .cse8) (and (= |v_P2_#t~ite17_47| v_~a~0_162) .cse9 (or (and .cse10 .cse7 (= |v_P2_#t~ite17_47| v_~a$w_buff1~0_118)) (and (= |v_P2_#t~ite17_47| v_~a~0_163) .cse11)))) (or (and .cse0 (= v_~a$w_buff0_used~0_457 0) .cse8) (and .cse9 (= v_~a$w_buff0_used~0_458 v_~a$w_buff0_used~0_457))) (or (and (= v_~a$w_buff1_used~0_378 v_~a$w_buff1_used~0_377) .cse2 .cse11) (and (= v_~a$w_buff1_used~0_377 0) (or (and .cse0 .cse1) (and .cse10 .cse7))))))) InVars {~a~0=v_~a~0_163, ~a$w_buff1~0=v_~a$w_buff1~0_118, ~a$w_buff0~0=v_~a$w_buff0~0_99, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_458, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_378, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_1|} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_457, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork3_#t~ite22=|v_P2Thread1of1ForFork3_#t~ite22_1|, ~a~0=v_~a~0_162, ~a$w_buff1~0=v_~a$w_buff1~0_118, ~a$w_buff0~0=v_~a$w_buff0~0_99, P2Thread1of1ForFork3_#t~ite20=|v_P2Thread1of1ForFork3_#t~ite20_1|, P2Thread1of1ForFork3_#t~ite21=|v_P2Thread1of1ForFork3_#t~ite21_1|, P2Thread1of1ForFork3_#t~ite19=|v_P2Thread1of1ForFork3_#t~ite19_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_377, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_2|, P2Thread1of1ForFork3_#t~ite18=|v_P2Thread1of1ForFork3_#t~ite18_1|} AuxVars[|v_P2_#t~ite17_47|] AssignedVars[P2Thread1of1ForFork3_#t~ite22, ~a~0, P2Thread1of1ForFork3_#t~ite20, ~a$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite21, P2Thread1of1ForFork3_#t~ite19, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0, P2Thread1of1ForFork3_#t~ite17, P2Thread1of1ForFork3_#t~ite18][140], [P1Thread1of1ForFork2InUse, Black: 185#(= ULTIMATE.start_assume_abort_if_not_~cond 0), Black: 189#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), P3Thread1of1ForFork0InUse, Black: 238#(and (= ~a$r_buff0_thd4~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0))) (= ~a$r_buff0_thd2~0 0)), P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 139#true, 77#L854true, Black: 198#(<= ~__unbuffered_cnt~0 2), Black: 205#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 2)), 210#true, Black: 273#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 3)), Black: 264#(<= ~__unbuffered_cnt~0 3), 87#L878-1true, Black: 142#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0))), 155#true, 284#(and (= ~__unbuffered_p2_EAX~0 1) (= ~z~0 1)), Black: 212#(and (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), 30#L818true, Black: 213#(and (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1)), Black: 214#(= ~__unbuffered_p3_EBX~0 1), Black: 280#(= ~z~0 1), Black: 217#(and (= ~__unbuffered_p3_EBX~0 1) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a~0 1)), Black: 286#(and (= ~__unbuffered_p2_EAX~0 1) (= ~z~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression| 0))), 229#(and (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff0_thd2~0 0)), 38#L798true, Black: 158#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0))), 301#(and (= ~y~0 1) (= ~__unbuffered_p1_EBX~0 1)), 173#(<= ~__unbuffered_cnt~0 0), 114#L775true, Black: 176#(and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 0)), Black: 174#(= ULTIMATE.start_assume_abort_if_not_~cond 0), Black: 240#(and (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 242#(and (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p1_EBX~0 0))) (= ~a$r_buff0_thd2~0 0)), Black: 244#(and (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd2~0 0)), Black: 246#(and (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff0_thd2~0 0)), Black: 184#(<= ~__unbuffered_cnt~0 1)]) [2021-03-24 10:42:18,442 INFO L384 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2021-03-24 10:42:18,442 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-24 10:42:18,442 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-24 10:42:18,442 INFO L387 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2021-03-24 10:42:19,108 INFO L129 PetriNetUnfolder]: 7258/15908 cut-off events. [2021-03-24 10:42:19,109 INFO L130 PetriNetUnfolder]: For 41701/46214 co-relation queries the response was YES. [2021-03-24 10:42:19,207 INFO L84 FinitePrefix]: Finished finitePrefix Result has 61704 conditions, 15908 events. 7258/15908 cut-off events. For 41701/46214 co-relation queries the response was YES. Maximal size of possible extension queue 2403. Compared 183141 event pairs, 127 based on Foata normal form. 324/14722 useless extension candidates. Maximal degree in co-relation 61671. Up to 4399 conditions per place. [2021-03-24 10:42:19,227 INFO L132 encePairwiseOnDemand]: 184/195 looper letters, 33 selfloop transitions, 63 changer transitions 46/218 dead transitions. [2021-03-24 10:42:19,227 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 218 transitions, 2374 flow [2021-03-24 10:42:19,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-24 10:42:19,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-24 10:42:19,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1124 transitions. [2021-03-24 10:42:19,229 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8234432234432234 [2021-03-24 10:42:19,229 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1124 transitions. [2021-03-24 10:42:19,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1124 transitions. [2021-03-24 10:42:19,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:42:19,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1124 transitions. [2021-03-24 10:42:19,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 160.57142857142858) internal successors, (1124), 7 states have internal predecessors, (1124), 0 states have call successors, (0), 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-24 10:42:19,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 0 states have call successors, (0), 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-24 10:42:19,233 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 0 states have call successors, (0), 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-24 10:42:19,233 INFO L185 Difference]: Start difference. First operand has 107 places, 147 transitions, 1269 flow. Second operand 7 states and 1124 transitions. [2021-03-24 10:42:19,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 218 transitions, 2374 flow [2021-03-24 10:42:24,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 218 transitions, 2364 flow, removed 3 selfloop flow, removed 3 redundant places. [2021-03-24 10:42:24,595 INFO L241 Difference]: Finished difference. Result has 113 places, 162 transitions, 1673 flow [2021-03-24 10:42:24,595 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=1261, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1673, PETRI_PLACES=113, PETRI_TRANSITIONS=162} [2021-03-24 10:42:24,595 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 51 predicate places. [2021-03-24 10:42:24,595 INFO L480 AbstractCegarLoop]: Abstraction has has 113 places, 162 transitions, 1673 flow [2021-03-24 10:42:24,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 157.16666666666666) internal successors, (943), 6 states have internal predecessors, (943), 0 states have call successors, (0), 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-24 10:42:24,596 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:42:24,596 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:42:24,596 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-24 10:42:24,596 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:42:24,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:42:24,597 INFO L82 PathProgramCache]: Analyzing trace with hash 446361546, now seen corresponding path program 3 times [2021-03-24 10:42:24,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:42:24,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895423392] [2021-03-24 10:42:24,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:42:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:42:24,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:24,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:42:24,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:24,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:42:24,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:24,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 10:42:24,657 INFO L142 QuantifierPusher]: treesize reduction 4, result has 88.9 percent of original size [2021-03-24 10:42:24,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-24 10:42:24,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:24,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-24 10:42:24,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:24,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 10:42:24,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:24,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:42:24,699 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:42:24,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:42:24,705 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-24 10:42:24,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895423392] [2021-03-24 10:42:24,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:42:24,705 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-24 10:42:24,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397035235] [2021-03-24 10:42:24,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-24 10:42:24,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:42:24,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-24 10:42:24,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-03-24 10:42:24,707 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 195 [2021-03-24 10:42:24,708 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 162 transitions, 1673 flow. Second operand has 9 states, 9 states have (on average 150.66666666666666) internal successors, (1356), 9 states have internal predecessors, (1356), 0 states have call successors, (0), 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-24 10:42:24,708 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:42:24,708 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 195 [2021-03-24 10:42:24,708 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:42:26,510 INFO L129 PetriNetUnfolder]: 8466/20084 cut-off events. [2021-03-24 10:42:26,511 INFO L130 PetriNetUnfolder]: For 65235/71293 co-relation queries the response was YES. [2021-03-24 10:42:26,618 INFO L84 FinitePrefix]: Finished finitePrefix Result has 77817 conditions, 20084 events. 8466/20084 cut-off events. For 65235/71293 co-relation queries the response was YES. Maximal size of possible extension queue 3489. Compared 256397 event pairs, 252 based on Foata normal form. 697/18762 useless extension candidates. Maximal degree in co-relation 77782. Up to 5695 conditions per place. [2021-03-24 10:42:26,641 INFO L132 encePairwiseOnDemand]: 186/195 looper letters, 41 selfloop transitions, 20 changer transitions 6/185 dead transitions. [2021-03-24 10:42:26,641 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 185 transitions, 2024 flow [2021-03-24 10:42:26,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-24 10:42:26,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-24 10:42:26,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1374 transitions. [2021-03-24 10:42:26,644 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7829059829059829 [2021-03-24 10:42:26,644 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1374 transitions. [2021-03-24 10:42:26,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1374 transitions. [2021-03-24 10:42:26,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:42:26,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1374 transitions. [2021-03-24 10:42:26,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 152.66666666666666) internal successors, (1374), 9 states have internal predecessors, (1374), 0 states have call successors, (0), 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-24 10:42:26,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 195.0) internal successors, (1950), 10 states have internal predecessors, (1950), 0 states have call successors, (0), 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-24 10:42:26,648 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 195.0) internal successors, (1950), 10 states have internal predecessors, (1950), 0 states have call successors, (0), 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-24 10:42:26,648 INFO L185 Difference]: Start difference. First operand has 113 places, 162 transitions, 1673 flow. Second operand 9 states and 1374 transitions. [2021-03-24 10:42:26,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 185 transitions, 2024 flow [2021-03-24 10:42:34,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 185 transitions, 2022 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-24 10:42:34,831 INFO L241 Difference]: Finished difference. Result has 124 places, 169 transitions, 1830 flow [2021-03-24 10:42:34,831 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=1671, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1830, PETRI_PLACES=124, PETRI_TRANSITIONS=169} [2021-03-24 10:42:34,831 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 62 predicate places. [2021-03-24 10:42:34,831 INFO L480 AbstractCegarLoop]: Abstraction has has 124 places, 169 transitions, 1830 flow [2021-03-24 10:42:34,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 150.66666666666666) internal successors, (1356), 9 states have internal predecessors, (1356), 0 states have call successors, (0), 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-24 10:42:34,831 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:42:34,831 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:42:34,832 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-24 10:42:34,832 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:42:34,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:42:34,832 INFO L82 PathProgramCache]: Analyzing trace with hash -511912832, now seen corresponding path program 4 times [2021-03-24 10:42:34,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:42:34,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929430202] [2021-03-24 10:42:34,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:42:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:42:34,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:34,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:42:34,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:34,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 10:42:34,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:34,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 10:42:34,901 INFO L142 QuantifierPusher]: treesize reduction 5, result has 88.9 percent of original size [2021-03-24 10:42:34,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-24 10:42:34,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:34,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-24 10:42:34,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:34,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-24 10:42:34,938 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:34,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-24 10:42:34,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:42:34,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:42:34,959 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:42:34,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:42:34,965 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-24 10:42:34,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929430202] [2021-03-24 10:42:34,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:42:34,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-24 10:42:34,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191576591] [2021-03-24 10:42:34,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-24 10:42:34,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:42:34,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-24 10:42:34,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-03-24 10:42:34,968 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 195 [2021-03-24 10:42:34,969 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 169 transitions, 1830 flow. Second operand has 10 states, 10 states have (on average 148.5) internal successors, (1485), 10 states have internal predecessors, (1485), 0 states have call successors, (0), 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-24 10:42:34,969 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:42:34,969 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 195 [2021-03-24 10:42:34,969 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:42:36,812 INFO L129 PetriNetUnfolder]: 8548/20160 cut-off events. [2021-03-24 10:42:36,812 INFO L130 PetriNetUnfolder]: For 76142/81950 co-relation queries the response was YES. [2021-03-24 10:42:36,968 INFO L84 FinitePrefix]: Finished finitePrefix Result has 80164 conditions, 20160 events. 8548/20160 cut-off events. For 76142/81950 co-relation queries the response was YES. Maximal size of possible extension queue 3553. Compared 256966 event pairs, 225 based on Foata normal form. 595/18715 useless extension candidates. Maximal degree in co-relation 80124. Up to 5665 conditions per place. [2021-03-24 10:42:36,994 INFO L132 encePairwiseOnDemand]: 187/195 looper letters, 30 selfloop transitions, 21 changer transitions 39/179 dead transitions. [2021-03-24 10:42:36,994 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 179 transitions, 2050 flow [2021-03-24 10:42:36,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-24 10:42:36,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-24 10:42:36,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1352 transitions. [2021-03-24 10:42:36,996 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7703703703703704 [2021-03-24 10:42:36,996 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1352 transitions. [2021-03-24 10:42:36,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1352 transitions. [2021-03-24 10:42:36,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:42:36,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1352 transitions. [2021-03-24 10:42:36,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 150.22222222222223) internal successors, (1352), 9 states have internal predecessors, (1352), 0 states have call successors, (0), 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-24 10:42:37,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 195.0) internal successors, (1950), 10 states have internal predecessors, (1950), 0 states have call successors, (0), 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-24 10:42:37,000 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 195.0) internal successors, (1950), 10 states have internal predecessors, (1950), 0 states have call successors, (0), 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-24 10:42:37,000 INFO L185 Difference]: Start difference. First operand has 124 places, 169 transitions, 1830 flow. Second operand 9 states and 1352 transitions. [2021-03-24 10:42:37,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 179 transitions, 2050 flow [2021-03-24 10:42:43,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 179 transitions, 2039 flow, removed 4 selfloop flow, removed 3 redundant places. [2021-03-24 10:42:43,848 INFO L241 Difference]: Finished difference. Result has 131 places, 137 transitions, 1388 flow [2021-03-24 10:42:43,849 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=1819, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1388, PETRI_PLACES=131, PETRI_TRANSITIONS=137} [2021-03-24 10:42:43,849 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, 69 predicate places. [2021-03-24 10:42:43,849 INFO L480 AbstractCegarLoop]: Abstraction has has 131 places, 137 transitions, 1388 flow [2021-03-24 10:42:43,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 148.5) internal successors, (1485), 10 states have internal predecessors, (1485), 0 states have call successors, (0), 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-24 10:42:43,849 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:42:43,849 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:42:43,849 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-24 10:42:43,850 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:42:43,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:42:43,850 INFO L82 PathProgramCache]: Analyzing trace with hash 797585314, now seen corresponding path program 5 times [2021-03-24 10:42:43,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:42:43,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754753427] [2021-03-24 10:42:43,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:42:43,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-24 10:42:43,876 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-24 10:42:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-24 10:42:43,907 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-24 10:42:43,934 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-24 10:42:43,934 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-24 10:42:43,934 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-24 10:42:44,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.03 10:42:44 BasicIcfg [2021-03-24 10:42:44,020 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-24 10:42:44,021 INFO L168 Benchmark]: Toolchain (without parser) took 41033.63 ms. Allocated memory was 255.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 235.6 MB in the beginning and 1.8 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.0 GB. Max. memory is 16.0 GB. [2021-03-24 10:42:44,021 INFO L168 Benchmark]: CDTParser took 0.08 ms. Allocated memory is still 255.9 MB. Free memory was 237.6 MB in the beginning and 237.5 MB in the end (delta: 174.8 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-24 10:42:44,021 INFO L168 Benchmark]: CACSL2BoogieTranslator took 500.71 ms. Allocated memory was 255.9 MB in the beginning and 358.6 MB in the end (delta: 102.8 MB). Free memory was 234.9 MB in the beginning and 318.0 MB in the end (delta: -83.1 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. [2021-03-24 10:42:44,021 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.96 ms. Allocated memory is still 358.6 MB. Free memory was 318.0 MB in the beginning and 315.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-24 10:42:44,021 INFO L168 Benchmark]: Boogie Preprocessor took 34.33 ms. Allocated memory is still 358.6 MB. Free memory was 315.5 MB in the beginning and 312.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-24 10:42:44,022 INFO L168 Benchmark]: RCFGBuilder took 1503.08 ms. Allocated memory was 358.6 MB in the beginning and 432.0 MB in the end (delta: 73.4 MB). Free memory was 312.9 MB in the beginning and 374.0 MB in the end (delta: -61.2 MB). Peak memory consumption was 66.1 MB. Max. memory is 16.0 GB. [2021-03-24 10:42:44,022 INFO L168 Benchmark]: TraceAbstraction took 38929.27 ms. Allocated memory was 432.0 MB in the beginning and 3.8 GB in the end (delta: 3.4 GB). Free memory was 374.0 MB in the beginning and 1.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.0 GB. Max. memory is 16.0 GB. [2021-03-24 10:42:44,023 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.08 ms. Allocated memory is still 255.9 MB. Free memory was 237.6 MB in the beginning and 237.5 MB in the end (delta: 174.8 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 500.71 ms. Allocated memory was 255.9 MB in the beginning and 358.6 MB in the end (delta: 102.8 MB). Free memory was 234.9 MB in the beginning and 318.0 MB in the end (delta: -83.1 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 60.96 ms. Allocated memory is still 358.6 MB. Free memory was 318.0 MB in the beginning and 315.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 34.33 ms. Allocated memory is still 358.6 MB. Free memory was 315.5 MB in the beginning and 312.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1503.08 ms. Allocated memory was 358.6 MB in the beginning and 432.0 MB in the end (delta: 73.4 MB). Free memory was 312.9 MB in the beginning and 374.0 MB in the end (delta: -61.2 MB). Peak memory consumption was 66.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 38929.27 ms. Allocated memory was 432.0 MB in the beginning and 3.8 GB in the end (delta: 3.4 GB). Free memory was 374.0 MB in the beginning and 1.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.0 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2281.3ms, 127 PlacesBefore, 62 PlacesAfterwards, 116 TransitionsBefore, 50 TransitionsAfterwards, 2894 CoEnabledTransitionPairs, 5 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 75 TotalNumberOfCompositions, 5670 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2119, positive: 1997, positive conditional: 0, positive unconditional: 1997, negative: 122, negative conditional: 0, negative unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1318, positive: 1281, positive conditional: 0, positive unconditional: 1281, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1318, positive: 1281, positive conditional: 0, positive unconditional: 1281, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2119, positive: 716, positive conditional: 0, positive unconditional: 716, negative: 85, negative conditional: 0, negative unconditional: 85, unknown: 1318, unknown conditional: 0, unknown unconditional: 1318] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 114, Positive conditional cache size: 0, Positive unconditional cache size: 114, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0] [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0] [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t361; [L872] FCALL, FORK 0 pthread_create(&t361, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L873] 0 pthread_t t362; [L874] FCALL, FORK 0 pthread_create(&t362, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L790] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L875] 0 pthread_t t363; [L876] FCALL, FORK 0 pthread_create(&t363, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L807] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L810] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L877] 0 pthread_t t364; [L878] FCALL, FORK 0 pthread_create(&t364, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L793] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L793] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L795] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L795] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L796] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L797] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L797] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 a$flush_delayed = weak$$choice2 [L836] 4 a$mem_tmp = a [L837] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L837] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L838] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L838] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L839] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L839] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L840] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L840] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L841] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L842] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L843] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = a [L845] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L845] 4 a = a$flush_delayed ? a$mem_tmp : a [L846] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L849] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L849] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L849] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L849] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L850] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L850] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L851] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L851] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L852] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L852] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L853] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L853] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L813] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L813] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L815] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L816] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L816] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L817] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L817] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L884] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L884] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L884] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L884] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L885] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L885] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L886] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L886] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L887] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L887] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L888] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L888] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L891] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 38750.8ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 34981.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2337.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 165 SDtfs, 209 SDslu, 316 SDs, 0 SdLazy, 803 SolverSat, 161 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 608.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 576.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1830occurred in iteration=12, InterpolantAutomatonStates: 98, 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: 36.9ms SsaConstructionTime, 323.2ms SatisfiabilityAnalysisTime, 855.6ms InterpolantComputationTime, 468 NumberOfCodeBlocks, 468 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 414 ConstructedInterpolants, 0 QuantifiedInterpolants, 2581 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...